Results 1 
1 of
1
TimeSpace Tradeoffs for Nondeterministic Computation
 In Proceedings of the 15th IEEE Conference on Computational Complexity
, 2000
"... We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose randomaccess Turing machines in time n 1.618 and space n o(1) . This improves recent results of Fortnow and of Lipton and Viglas. In general, for any constant a less tha ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose randomaccess Turing machines in time n 1.618 and space n o(1) . This improves recent results of Fortnow and of Lipton and Viglas. In general, for any constant a less than the golden ratio, we prove that satisfiability cannot be solved in time n a and space n b for some positive constant b. Our techniques allow us to establish this result for b < 1 2 ( a+2 a 2  a). We can do better for a close to the golden ratio, for example, satisfiability cannot be solved by a randomaccess Turing machine using n 1.46 time and n .11 space. We also show tradeoffs for nondeterministic linear time computations using sublinear space. For example, there exists a language computable in nondeterministic linear time and n .619 space that cannot be computed in deterministic n 1.618 time and n o(1) space. Higher up the polynomialtime hierarchy we can get be...