Time-Space Tradeoffs for Satisfiability (1997)

Cached

Download Links

by Lance Fortnow
Venue:Journal of Computer and System Sciences
Citations:29 - 1 self

Active Bibliography

22 Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space – Lance Fortnow - 1996
9 Computational Complexity – Oded Goldreich, Avi Wigderson - 2004
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
40 The Role of Relativization in Complexity Theory – Lance Fortnow - 1994
10 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
1 On superlinear lower bounds in complexity theory – Kenneth W. Regan - 1995
2 Computational Complexity Theory – Michael Loui - 1996
2 Complexity Classes – Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
5 Machine Models and Linear Time Complexity – Kenneth W. Regan - 1993
4 Linear time and memory-efficient computation – Kenneth W. Regan - 1992
12 A Survey of Lower Bounds for Satisfiability and Related Problems – Van Melkebeek - 2007
Alternative notions of approximation and space-bounded computations – Alina Beygelzimer - 2003
A Glossary of Complexity Classes – n.n.
3 On Quasilinear Time Complexity Theory – Ashish V. Naik, Kenneth W. Regan, D. Sivakumar - 1994
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
57 Models of Computation -- Exploring the Power of Computing – John E. Savage
10 The Power Of Interaction – Carsten Lund - 1991
14 Inductive Time-Space Lower Bounds for SAT and Related Problems – Ryan Williams - 2005