Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Information and Computation
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Approximate Counting and Quantum Computation
Combinatorics, Probability and Computing
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Revisiting a limit on efficient quantum computation
Proceedings of the 44th annual Southeast regional conference
Uniformity of quantum circuit families for error-free algorithms
Theoretical Computer Science
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
A review of procedures to evolve quantum algorithms
Genetic Programming and Evolvable Machines
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum computing and polynomial equations over the finite field Z2
Quantum Information & Computation
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Quantum algorithms for a set of group theoretic problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
| Hi-index | 0.00 |