Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space

Authors:
Yuri Gurevich
Affiliations:
-
Venue:
Journal of the ACM (JACM)
Year:
1990

Citing 2
Cited 5

A natural np-complete problem with a nontrivial lower bound

SIAM Journal on Computing
Lower bounds for recognizing small cliques on CRCW PRAM'S

Discrete Applied Mathematics

Lower bounds on the complexity of recognizing SAT by turing machines

Information Processing Letters
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the Complexity of SAT

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Graph properties checkable in linear time in the number of vertices

Journal of Computer and System Sciences
Yuri, logic, and computer science

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique is developed for establishing lower bounds on the computational complexity of certain natural problems. The results have the form of time-space trade-off and exhibit the power of nondeterminism. In particular, a form of the clique problem is defined, and it is proved that:a nondeterministic log-space Turing machine solves the problem in linear time, butno deterministic machine (in a very general use of this term) with sequential-access input tape and work space n&sgr; solves the problem in time n1+&tgr; if &sgr; + 2&tgr;