Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Quantum bit-commitment for small storage based on quantum one-way permutations
New Generation Computing - Quantum computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
Quantum computation of zeta functions of curves
Computational Complexity
Classically controlled quantum computation
Mathematical Structures in Computer Science
Can quantum mechanics help distributed computing?
ACM SIGACT News
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Classically-controlled Quantum Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A full characterization of quantum advice
Proceedings of the forty-second ACM symposium on Theory of computing
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Testing non-isometry is QMA-complete
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Quantum Information & Computation
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Commutative version of the local Hamiltonian problem and common eigenspace problem
Quantum Information & Computation
The complexity of stoquastic local Hamiltonian problems
Quantum Information & Computation
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
Quantum Information & Computation
Quantum Information & Computation
On perfect completeness for QMA
Quantum Information & Computation
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
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
The complexity of the local hamiltonian problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
On QMA protocols with two short quantum proofs
Quantum Information & Computation
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...