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

  • Authors:

  • Yuri Gurevich;Saharon Shelah

  • Affiliations:

  • Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Mathematics, Hebrew University, Jerusalem 91904, Israel and Mathematics, Rutgers University, New Brunswick, NJ

  • Venue:
  • STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

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