Generic separations (1996)

by Harry Buhrman , Lance Fortnowy , Thomas Thieraufz , Universität Ulm
Venue:Journal of Computer and Systems Sciences
Citations:40 - 9 self

Active Bibliography

37 The Role of Relativization in Complexity Theory – Lance Fortnow - 1994
164 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
24 The Random Oracle Hypothesis is False – Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, Pankaj Rohatgi - 1994
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
6 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
56 New Collapse Consequences Of NP Having Small Circuits – Johannes Köbler, Osamu Watanabe - 1995
9 A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes – Andrei A. Muchnik, Nikolai K. Vereshchagin - 1994
15 Complexity-Theoretic Aspects of Interactive Proof Systems – Lance Jeremy Fortnow - 1989
7 A Tight Relationship between Generic Oracles and Type-2 Complexity Theory – Stephen Cook, Russell Impagliazzo, Tomoyuki Yamakami - 1997
9 On the Structure of Low Sets – Johannes Köbler - 1995
25 Time-Space Tradeoffs for Satisfiability – Lance Fortnow - 1997
2 Tally NP Sets and Easy Census Functions – Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe - 1998
Fault-Tolerance and Complexity – Lane A. Heraachandra - 1993
5 Oracles are subtle but not malicious – Scott Aaronson - 2006
16 Algebrization: A new barrier in complexity theory – Scott Aaronson, Avi Wigderson - 2007
Circuit Lower Bounds Collapse Relativized Complexity Classes – Richard Beigel, Alexis Maciel - 1998
6 Relativization: A revisionistic retrospective – Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi - 1992
67 Some Connections between Bounded Query Classes and Non-Uniform Complexity – Amihood Amir - 1990