Time-Space Tradeoffs for Satisfiability (1997)

Cached

Download Links

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

Documents Related by Co-Citation

25 On the Complexity of SAT – Richard Lipton, Anastasios Viglas - 1999
25 Time-Space Lower Bounds for Satisfiability – Lance Fortnow, Anastasios Viglas, Dieter Van Melkebeek - 2005
19 Time-Space Tradeoffs in the Counting Hierarchy – Eric Allender, Michal Koucky, V Vinay, et al. - 2001
20 Time-Space Lower Bounds for NP-Complete Problems – D van Melkebeek - 2004
24 Time-Space Tradeoffs for Nondeterministic Computation – Lance Fortnow, Dieter Van Melkebeek - 2000
15 Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines – Scott Diehl, Dieter Melkebeek - 2006
22 Towards Separating Nondeterminism from Determinism – R Kannan - 1984
14 Inductive Time-Space Lower Bounds for SAT and Related Problems – Ryan Williams - 2005
14 Melkebeek. A Survey of Lower Bounds for Satisfiability and Related Problems – D van
60 Introduction to Circuit Complexity – H Vollmer - 1999
316 Relationships between nondeterministic and deterministic tape complexities – W J Savitch - 1970
12 A Survey of Lower Bounds for Satisfiability and Related Problems – Van Melkebeek - 2007
96 Relations among complexity measures – Nicholas Pippenger, Michael J Fischer - 1994
55 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
127 On Uniformity within NC¹ – David A. Mix Barrington, Neil Immerman, Howard Straubing - 1990
9 Division is in uniform TC – W Hesse - 2001
18 Division is in uniform TC 0 – WILLIAM HESSE - 2001
11 Time-Space Tradeoffs for Counting NP Solutions Modulo Integers – R. Ryan Williams - 2007
482 Quantum complexity theory – Ethan Bernstein, Umesh Vazirani - 1993