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:23 - 2 self

Active Bibliography

1 Amplifying Circuit Lower Bounds Against Polynomial Time With Applications – Richard J. Lipton, Ryan Williams
25 Time-Space Lower Bounds for Satisfiability – Lance Fortnow, Anastasios Viglas, Dieter Van Melkebeek - 2005
2 Automated proofs of time lower bounds – R. Ryan Williams - 2007
19 Time-Space Tradeoffs in the Counting Hierarchy – Eric Allender, Michal Koucky, V Vinay, et al. - 2001
14 Inductive Time-Space Lower Bounds for SAT and Related Problems – Ryan Williams - 2005
Local reductions – Hamid Jahanjou, Eric Miles, Emanuele Viola - 2013
12 A Survey of Lower Bounds for Satisfiability and Related Problems – Van Melkebeek - 2007
10 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
2 Computational Complexity Theory – Michael Loui - 1996
10 The Power Of Interaction – Carsten Lund - 1991
Lower bounds on the complexity of recognizing SAT by multitape TMs – Rahul Santhanam
6 Lower bounds on the complexity of recognizing SAT by Turing machines – Rahul Santhanam
www.stacs-conf.org ALTERNATION-TRADING PROOFS, LINEAR PROGRAMMING, AND – Lower Bounds, Ryan Williams - 2010
unknown title – Jean-yves Marion, Thomas Schwentick, Tu Dortmundt
1 Time-Space Lower Bounds for Satisfiability – Dieter Van Melkebeek - 2001
2 Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas – R. Ryan Williams
3 On Quasilinear Time Complexity Theory – Ashish V. Naik, Kenneth W. Regan, D. Sivakumar - 1994
5 Machine Models and Linear Time Complexity – Kenneth W. Regan - 1993
1 On the Difference Between Turing Machine Time and Random-Access Machine Time (Extended Abstract) – Kenneth W. Regan