Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
SIGACT News complexity theory column 41
ACM SIGACT News
The complexity of tensor calculus
Computational Complexity
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Information and Computation
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Other complexity classes and measures
Algorithms and theory of computation handbook
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Complexity classes of equivalence problems revisited
Information and Computation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Model-checking hierarchical structures
Journal of Computer and System Sciences
On some complexity issues of NC analytic functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Logspace optimization problems and their approximability properties
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The isomorphism problem for k-trees is complete for logspace
Information and Computation
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
Computational Complexity
| Hi-index | 0.00 |