|
6
|
A Short History of Computational Complexity
– Lance Fortnow, Steve Homer
- 2002
|
|
88
|
Complexity Limitations on Quantum Computation
– Lance Fortnow, John Rogers
- 1997
|
|
|
The Computational Complexity Column
– Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
|
|
10
|
Nondeterministic quantum query and communication complexities, to appear in
– Ronald De Wolf
|
|
4
|
Analysis of quantum functions
– Tomoyuki Yamakami
- 1999
|
|
|
Analysis of Quantum Functions ⋆ (Preliminary Version)
– Tomoyuki Yamakami
- 1999
|
|
32
|
Determining Acceptance Possibility for a Quantum Computation is Hard for PH
– Stephen Fenner, Frederic Green , Steven Homer , Randall Pruim
- 1997
|
|
14
|
Quantum Computation
– Dorit Aharonov
- 1999
|
|
19
|
One Complexity Theorist's View of Quantum Computing
– Lance Fortnow
- 2000
|
|
7
|
Equivalences and separations between quantum and classical learnability
– Rocco A. Servedio, Steven, J. Gortler
- 2004
|
|
12
|
Quantum versus Classical Learnability
– Rocco A. Servedio, Steven J. Gortler
- 2000
|
|
19
|
Quantum Merlin Arthur proof systems, manuscript
– Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
- 2001
|
|
|
Revisiting a Limit on Efficient Quantum Computation
– Tarsem S. Purewal
|
|
22
|
Separability and One-way Functions
– Lance Fortnow , John Rogers
- 2000
|
|
37
|
Degrees of random sets
– Steven M. Kautz
- 1991
|
|
1
|
Almost Weakly 2-Generic Sets
– Stephen A. Fenner
- 1996
|
|
39
|
Limitations of Quantum Advice and One-Way Communication
– Scott Aaronson
- 2004
|
|
11
|
Quantum NP is Hard for PH
– S. Fenner, F. Green, S. Homer, R. Pruim
- 1998
|
|
2
|
Quantum and classical complexity classes: Separations, collapses, and closure properties
– Holger Spakowski, Mayur Thakur, Rahul Tripathi
- 2003
|
