An Improved Time-Space Lower Bound for Tautologies

Authors:
Scott Diehl;Dieter Melkebeek;Ryan Williams
Affiliations:
Computer Science Department, Siena College, Loudonville 12211;Computer Sciences Department, University of Wisconsin, Madison 53706;School of Mathematics, Institute for Advanced Study, Princeton, 08540
Venue:
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Year:
2009

Citing 6
Cited 0

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
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
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for all reals c and d such that c 2 d e 0 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 all $d there exists an e 0 such that tautologies cannot be decided by a nondeterministic algorithm that runs in time n d and space n e .