E. Bernstein and U.V. Vazirani, "Quantum complexity theory ", Proc. of the 25th STOC, pp. 11--20, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (5 citations) (Correct)
No context found.
E. Bernstein and U.V. Vazirani, "Quantum complexity theory ", Proc. of the 25th STOC, pp. 11--20, 1993.
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411--1473, 1997. 10
Quantum Entanglement and the Communication Complexity of the .. - Richard Cleve Wim (Correct)
No context found.
E. Bernstein, U. Vazirani, "Quantum Complexity Theory", SIAM J. Comput., Vol. 26, No. 5, 1997, pp. 1411--1473.
quant-ph/9708019 - Mar Quantum Entanglement (Correct)
No context found.
E. Bernstein, U. Vazirani, "Quantum Complexity Theory", SIAM J. Comput., Vol. 26, No. 5, 1997, pp. 1411--1473.
Quantum vs. Classical Communication and Computation - Harry Buhrman Cwi (Correct)
No context found.
E. Bernstein and U.V. Vazirani, "Quantum complexity theory ", Proc. of the 25th STOC, pp. 11--20, 1993.
Exponential Algorithmic Speedup by a Quantum Walk - Andrew Childs Richard (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. on Computing, 26:1411--1473, 1997.
A quantum Goldreich-Levin theorem - With Cryptographic Applications (Correct)
No context found.
E. Bernstein and U. V. Vazirani, \Quantum complexity theory", SIAM J. on Comput., Vol. 26, No. 5, pp. 1411-1473, 1997.
Sharp quantum vs. classical query complexity separations - Niel De Beaudrap (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997.
quant-ph/9911124 - Nov The Query (Correct)
No context found.
E. Bernstein and U.V. Vazirani, "Quantum complexity theory", SIAM J. on Comput., Vol. 26, No. 5, pp. 1411--1473, 1997. (An earlier version appeared in STOC '93.)
The query complexity of order-finding - Richard Cleve Department (Correct)
No context found.
E. Bernstein and U.V. Vazirani, "Quantum complexity theory", SIAM J. on Comput., Vol. 26, No. 5, pp. 1411-- 1473, 1997. (An earlier version appeared in STOC '93.)
A Transformation Framework for Solving Artificial Life Systems .. - GopalaKrishna (2005) (Correct)
No context found.
Bernstein, E. and Vazirani, U. (1997). Quantum complexity theory. SIAM Journal on Computing, 26(5):1411--1473.
On Ontic Oracles and Epistemic Artificial Life Systems - Gopalakrishna (2005) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411--1473, 1997.
Determining Acceptance Possibility for a Quantum - Hard (2000) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum Complexity Theory. SIAM J. Comp., 26:141--1473, 1997.
Determining Acceptance Possibility for a Quantum - Computation Is Hard (2000) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum Complexity Theory. SIAM J. Comp., 26:141--1473, 1997.
Towards Quantum Template Matching - Daniel Curtis And (Correct)
No context found.
E. Bernstein and U. Vazirani, "Quantum complexity theory", in Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, CA, 16--18 May 1993.
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory, SIAM J. Comput. 26(5):1411-- 1473, 1997.
The Geometry Of Quantum Learning - Hunziker, Meyer, Park, Pommersheim.. (2003) (Correct)
No context found.
E. Bernstein and U. Vazirani, "Quantum complexity theory", in Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, CA, 16--18 May 1993.
Defying Dimensions Modulo 6 - Grolmusz (2003) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computation, pages 11-20, New York, 1993. ACM press.
Is Quantum Mechanics an Island in Theoryspace? - Aaronson (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing 26(5):1411-- 1473, 1997.
On the Power of Quantum Proofs - Raz, Shpilka (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997.
On Universal and Fault-Tolerant Quantum Computing - Boykin, Mor, Pulver.. (1999) (7 citations) (Correct)
No context found.
E. Bernstein and U. Vazirani, \Quantum complexity theory," SIAM J. Computing, 26(1997), pp. 1411-1473.
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (1 citation) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411--1473, 1997. Earlier version in STOC'93.
One Complexity Theorist's View of Quantum Computing - Lance Fortnow Nec (2000) (2 citations) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997.
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
No context found.
E. Bernstein and U. Vazirani. Quantum complexity theory, SIAM Journal on Computing, 26(5):1411-- 1473, 1997.
COCOON'01 Submission - Title Deterministic Application (Correct)
No context found.
E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM Journal on Computing 26, 1411--1473 (1997).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC