An oracle builder’s toolkit (2002)

by Stephen Fenner , Lance Fortnow , Stuart A. Kurtz, Lide Li
Citations:47 - 10 self

Active Bibliography

11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
96 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 – Ronald De Wolf - 2003
4 Analysis of quantum functions – Tomoyuki Yamakami - 1999
Analysis of Quantum Functions ⋆ (Preliminary Version) – Tomoyuki Yamakami - 1999
34 Determining Acceptance Possibility for a Quantum Computation is Hard for PH – Stephen Fenner, Frederic Green , Steven Homer , Randall Pruim - 1997
17 Quantum Computation – Dorit Aharonov - 1999
9 Equivalences and separations between quantum and classical learnability – Rocco A. Servedio, Steven, J. Gortler - 2004
24 Quantum Merlin-Arthur proof systems: Are multiple . . . – Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami - 2008
13 Quantum versus Classical Learnability – Rocco A. Servedio, Steven J. Gortler - 2000
23 One Complexity Theorist's View of Quantum Computing – Lance Fortnow - 2000
Revisiting a Limit on Efficient Quantum Computation – Tarsem S. Purewal
Black Boxes, Incorporated – Mohammad Mahmoody, Avi Wigderson - 2012
27 Separability and One-way Functions – Lance Fortnow , John Rogers - 2000
1 Almost Weakly 2-Generic Sets – Stephen A. Fenner - 1996
46 Degrees of random sets – Steven M. Kautz - 1991
11 Quantum NP is Hard for PH – S. Fenner, F. Green, S. Homer, R. Pruim - 1998
17 Characterization of non-deterministic quantum query and quantum communication complexity – Ronald De Wolf - 2000