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

Yuri Gurevich, Saharon Shelah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Log-size Parabolic Clique Problem is a version of Clique Problem solvable in linear time by a log-space nondeterministic Turing machine. However, no deterministic machine (in a very general sense of this term) with sequential-access read-only input tape and work space nσ solves Log-size Parabolic Clique Problem within time n1+τ if σ + 2τ < 1/2.

Original languageEnglish
Title of host publicationProceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988
PublisherAssociation for Computing Machinery
Pages281-289
Number of pages9
ISBN (Print)0897912640, 9780897912648
DOIs
StatePublished - 1988
Event20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States
Duration: 2 May 19884 May 1988

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference20th Annual ACM Symposium on Theory of Computing, STOC 1988
Country/TerritoryUnited States
CityChicago, IL
Period2/05/884/05/88

Fingerprint

Dive into the research topics of 'Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space'. Together they form a unique fingerprint.

Cite this