Time-Space Tradeoffs for Nondeterministic Computation (2000)

Cached

Download Links

by Lance Fortnow , Dieter Van Melkebeek
Venue:In Proceedings of the 15th IEEE Conference on Computational Complexity
Citations:21 - 2 self

Active Bibliography

513 How bad is selfish routing? – Tim Roughgarden, Éva Tardos - 2002
623 Multiparty Communication Complexity – Danny Dolev, Tomás Feder - 1989
25 Time-Space Lower Bounds for Satisfiability – Lance Fortnow, Anastasios Viglas, Dieter Van Melkebeek - 2005
1 Amplifying Circuit Lower Bounds Against Polynomial Time With Applications – Richard J. Lipton, Ryan Williams
18 Time-Space Tradeoffs in the Counting Hierarchy – Eric Allender, Michal Koucky, V Vinay, et al. - 2001
2 Automated proofs of time lower bounds – R. Ryan Williams - 2007
407 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
368 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
330 The DLV System for Knowledge Representation and Reasoning – Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello - 2002