Generic separations (1996)

Cached

Download Links

by Harry Buhrman , Lance Fortnow , Thomas Thierauf
Venue:JOURNAL OF COMPUTER AND SYSTEMS SCIENCES

Active Bibliography

Comparing Notions of Full Derandomization – Lance Fortnow Nec, Lance Fortnow - 2001
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
111 BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs (Extended Abstract) – Laszlo Babai, Noam Nissan, Lance Fortnow, Avi Wigderson - 1993
3 Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy – A. Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran - 2006
9 On helping and interactive proof systems – V. Arvind, J. Köbler, R. Schuler - 1995
10 The Power Of Interaction – Carsten Lund - 1991
2 Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy – Alan L. Selman, Samik Sengupta - 2004
56 New Collapse Consequences Of NP Having Small Circuits – Johannes Köbler, Osamu Watanabe - 1995
3 Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds – Barıs Aydınlıo˜glu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi - 2010
2 Limitations of Hardness vs. Randomness under Uniform Reductions – Dan Gutfreund, Salil Vadhan - 2008
6 New Lowness Results for ZPP^NP and other Complexity Classes – V. Arvind, Johannes Köbler - 2000
13 Verifying and decoding in constant depth – Shafi Goldwasser, Tali Kaufman - 2007
Circuit Lower Bounds Collapse Relativized Complexity Classes – Richard Beigel, Alexis Maciel - 1998
1 An Axiomatic Approach to Algebrization – Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
11 Relativizing versus nonrelativizing techniques: The role of local checkability – Sanjeev Arora, Russell Impagliazzo, Umesh Vazirani - 1992
23 NP Might Not Be As Easy As Detecting Unique Solutions – Richard Beigel, Harry Buhrman, Lance Fortnow, U. Chicago - 1998
22 One Complexity Theorist's View of Quantum Computing – Lance Fortnow - 2000
5 Oracles are subtle but not malicious – Scott Aaronson - 2006