|
22
|
On the Complexity of SAT
– Richard Lipton, Anastasios Viglas
- 1999
|
|
16
|
Time-space lower bounds for NP-complete problems
– D van Melkebeek
- 2004
|
|
21
|
Time-Space Tradeoffs for Nondeterministic Computation
– Lance Fortnow, Dieter Van Melkebeek
- 2000
|
|
19
|
Time-Space Lower Bounds for Satisfiability
– Lance Fortnow, Anastasios Viglas, Dieter Van Melkebeek
- 2005
|
|
15
|
Time-Space Tradeoffs in the Counting Hierarchy
– Eric Allender, Michal Koucky, V Vinay, et al.
- 2001
|
|
19
|
Towards separating nondeterminism from determinism
– R Kannan
- 1984
|
|
262
|
Relationships between nondeterministic and deterministic tape complexities
– W J Savitch
- 1970
|
|
11
|
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
– Scott Diehl, Dieter Melkebeek
- 2006
|
|
9
|
Inductive Time-Space Lower Bounds for SAT and Related Problems
– Ryan Williams
- 2005
|
|
53
|
Introduction to Circuit Complexity
– H Vollmer
- 1999
|
|
26
|
Time-Space Tradeoff Lower Bounds for Randomized Computation of Decision Problems
– Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee
- 2000
|
|
10
|
A Survey of Lower Bounds for Satisfiability and Related Problems
– Van Melkebeek
- 2007
|
|
33
|
Trotter: On determinism versus non-determinism and related problems
– W J Paul, N Pippenger, E Szemerédi, W T
- 1983
|
|
8
|
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
– R. Ryan Williams
- 2007
|
|
8
|
Melkebeek. A survey of lower bounds for satisfiability and related problems
– D van
- 2007
|
|
53
|
A non-linear time lower bound for boolean branching programs
– Miklós Ajtai
- 1999
|
|
126
|
On Uniformity within NC¹
– David A. Mix Barrington, Neil Immerman, Howard Straubing
- 1990
|
|
9
|
Division is in uniform TC
– W Hesse
- 2001
|
|
139
|
On uniform circuit complexity
– W L Ruzzo
- 1981
|
