We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely,
we show that SAT cannot be solved simultaneously in n/sup 1+ 0 (1)/time and n/sup 1-/spl …

We give the first nontrivial model-independent time–space tradeoffs for satisfiability. Namely,
we show that SAT cannot be solved in n1+ o (1) time and n1− ε space for any ε> 0 general …

We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot
be solved on general purpose random-access Turing machines in time n/sup 1.618/and …

We establish the first polynomial time-space lower bounds for satisfiability on general
models of computation. We show that for any constant c less than the golden ratio there …

We improve upon indirect diagonalization arguments for lower bounds on explicit problems
within the polynomial hierarchy. Our contributions are summarized as follows. 1. We present …

We survey the recent lower bounds on the running time of general-purpose randomaccess
machines that solve satisfiability in a small amount of work space, and related lower bounds …

We show that non-deterministic time NTIME (n) is not contained in deterministic time n/sup 2-
/spl epsiv//and polylogarithmic space, for any/spl epsiv/> 0. This implies that (infinitely often) …

We show that a deterministic Turing machine with one d-dimensional work tape and random
access to the input cannot solve satisfiability in time na for a<(d+ 2)/(d+ 1). For …

The problem of deciding whether a given propositional formula in conjunctive normal form is
satisfiable has been widely studied. I t is known that, when restricted to formulas having only …

The arguments used by R. Kannan (1984, Math. Systems Theory17, 29–45), L. Fortnow
(1997, in “Proceedings, Twelfth Annual IEEE Conference on Computational Complexity …