Join-Reachability Problems in Directed Graphs.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 347, doi. 10.1007/s00224-013-9450-7
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2014 AND VI 55 AND IP 2
Results: 9
1
2
Learning Read-Constant Polynomials of Constant Degree Modulo Composites.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 404, doi. 10.1007/s00224-013-9488-6
- By:
- Publication type:
- Article
3
The Equivalence of Sampling and Searching.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 281, doi. 10.1007/s00224-013-9527-3
- By:
- Publication type:
- Article
4
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via 'Naive' Derandomization.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 299, doi. 10.1007/s00224-012-9432-1
- By:
- Publication type:
- Article
5
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 330, doi. 10.1007/s00224-013-9490-z
- By:
- Publication type:
- Article
6
Editorial.
- Published in:
- 2014
- By:
- Publication type:
- Editorial
7
The Complexity of Solving Reachability Games Using Value and Strategy Iteration.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 380, doi. 10.1007/s00224-013-9524-6
- By:
- Publication type:
- Article
8
Two-Way Automata Versus Logarithmic Space.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 421, doi. 10.1007/s00224-013-9465-0
- By:
- Publication type:
- Article
9
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error.
- Published in:
- Theory of Computing Systems, 2014, v. 55, n. 2, p. 313, doi. 10.1007/s00224-012-9425-0
- By:
- Publication type:
- Article