Abstract
We show that for all reals c and d such that c 2 d<4 there exists a positive real e such that tautologies of length n cannot be decided by both a nondeterministic algorithm that runs in time n c, and a nondeterministic algorithm that runs in time n d and space n e. In particular, for every \(d<\sqrt[3]{4}\) there exists a positive e such that tautologies cannot be decided by a nondeterministic algorithm that runs in time n d and space n e.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beame P, Pitassi T (2001) Propositional proof complexity: past, present, and future. In: Paun G, Rozenberg G, Salomaa A (eds) Current trends in theoretical computer science: entering the 21st century. World Scientific, Singapore, pp 42–70
Fortnow L (2000) Time-space tradeoffs for satisfiability. J Comput Syst Sci 60:337–353
Fortnow L, Van Melkebeek D (2000) Time-space tradeoffs for nondeterministic computation. In: Proceedings of the 15th IEEE conference on computational complexity. IEEE Press, New York, pp 2–13
Fortnow L, Lipton R, Van Melkebeek D, Viglas A (2005) Time-space lower bounds for satisfiability. J ACM 52:835–865
Savitch W (1970) Relationships between nondeterministic and deterministic tape complexities. J Comput Syst Sci 4:177–192
Van Melkebeek D (2007) A survey of lower bounds for satisfiability and related problems. Found Trends Theor Comput Sci 2:197–303
Williams R (2009) Alternation-trading proofs, linear programming, and lower bounds. Manuscript available at http://www.cs.cmu.edu/~ryanw/automated-lbs.pdf
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Diehl, S., van Melkebeek, D. & Williams, R. An improved time-space lower bound for tautologies. J Comb Optim 22, 325–338 (2011). https://doi.org/10.1007/s10878-009-9286-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9286-x