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
20 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
23 Time-Space Tradeoffs for Nondeterministic Computation – Lance Fortnow, Dieter Van Melkebeek - 2000
16 Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines – Scott Diehl, Dieter Melkebeek - 2006
23 Towards separating nondeterminism from determinism – R Kannan - 1984
13 Inductive Time-Space Lower Bounds for SAT and Related Problems – Ryan Williams - 2005
13 Melkebeek. A survey of lower bounds for satisfiability and related problems – D van
61 Introduction to circuit complexity – Heribert Vollmer - 1999
318 Relationships between nondeterministic and deterministic tape complexities – W J Savitch - 1970
15 A Survey of Lower Bounds for Satisfiability and Related Problems – Van Melkebeek - 2007
100 Relations Among Complexity Measures – Nicholas Pippenger, Michael J Fischer - 1979
59 A non-linear time lower bound for boolean branching programs – Miklós Ajtai - 1999
177 Natural Proofs – Alexander A. Razborov, Steven Rudich - 1994
9 Division is in uniform TC – W Hesse - 2001
127 On Uniformity within NC¹ – David A. Mix Barrington, Neil Immerman, Howard Straubing - 1990
19 Division is in uniform TC 0 – W Hesse - 2001
11 Time-Space Tradeoffs for Counting NP Solutions Modulo Integers – R. Ryan Williams - 2007