An improved time-space lower bound for tautologies

Authors:
Scott Diehl;Dieter Melkebeek;Ryan Williams
Affiliations:
Department of Computer Sciences, University of Wisconsin-Madison, Madison, USA 53706;Department of Computer Sciences, University of Wisconsin-Madison, Madison, USA 53706;Department of Computer Sciences, University of Wisconsin-Madison, Madison, USA 53706
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 6
Cited 1

Time—space tradeoffs for satisfiability

Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Propositional proof complexity: past, present, and future

Current trends in theoretical computer science
Time-Space Tradeoffs for Nondeterministic Computation

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Time-space lower bounds for satisfiability

Journal of the ACM (JACM)
A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for all reals c and d such that c 2 de 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 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 .