On determinism versus non-determinism and related problems

  title={On determinism versus non-determinism and related problems},
  author={Wolfgang J. Paul and Nicholas Pippenger and Endre Szemer{\'e}di and William T. Trotter},
  journal={24th Annual Symposium on Foundations of Computer Science (sfcs 1983)},
  • W. Paul, N. Pippenger, W. T. Trotter
  • Published 7 November 1983
  • Business, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
We show that, for multi-tape Turing machines, non-deterministic linear time is more powerful than deterministic linear time. We also discuss the prospects for extending this result to more general Turing machines. 
Alternating time versus deterministic time: a separation
  • Sanjay Gupta
  • Computer Science
    [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
  • 1993
It is shown that only two alternations are sufficient to achieve a log*t(n) speed-up of deterministic Turing machines and that for each time-constructible function t(n), two alternation are strictly more powerful than deterministic time.
Two tapes versus one for off-line Turing machines
We prove the first superlinear lower bound for a concrete, polynomial time recognizable decision problem on a Turing machine with one work tape and a two-way input tape (also called off-line 1-tape
On relationships between complexity classes of Turing machines
Classes of time and space complexity of Turing machines are defined, and relationships between them are discussed. New relationships between the defined complexity classes are described.
Two tapes are better than one for off-line Turing machines
This work proves the first superlinear lower bound for a concrete decision problem in P on a Turing machine with one work tape and a two-way input tape and shows for off-line Turing machines that 2 tapes are better than 1 and that 3 pushdown stores arebetter than 2.
Theory of One Tape Linear Time Turing Machines
This paper discusses the computational complexity of one-tape Turing machines of various machine types that halt in time O(n), where the running time of a machine is defined as the height of its computation tree.
Shrinking Multi-pushdown Automata
The expressive power of shrinking pushdown automata with more than two pushdown stores is studied, obtaining a close correspondence to linear time-bounded multi-tape Turing machines.
Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines
New techniques for proving quadratic lower bounds for deterministic and nondeterministic l-tape Turing machines (all considered Turing machines have an additional oneway input tape) are introduced and a substantial superiority of nondeterminism over determinism and of co-nond determinism over nond determinism for l-Tape TM's is demonstrated.
Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines
It is established in this paper that computations by tree-size and space simultaneously bounded ATMs roughly correspond to Computations by time and space simultaneous bounded nondeterministic TMs (NTMs).


Memory bounds for recognition of context-free and context-sensitive languages
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of
Alternation and the power of nondeterminism
The aim of this paper is to show how the existance of the polynomial-time hierarchy of Meyer and Stockmeyer(1972) and the related concept of alternation can be exploited to prove the power of nondeterminism over determinism in some contexts.
This work defines alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate, and shows that while n-state alternating finite automata accept only regular sets that can be accepted by 22n-O(logn) state deterministic automata, alternating pushdown automata acceptance all languages accepted by Turing machines in deterministic exponential time.
On alternation
For wellbehaved functions t(n) every nondeterministic t( n)-time bounded 1-tape Turing machine can be simulated by a deterministic ((nlogn)1/2 + (t(n))1/ 2)-tape bounded off-line Turing machine.
On Time versus Space II. (Turing Machines)
Graph-Theoretic Arguments in Low-Level Complexity
One approach to understanding complexity issues for certain easily computable natural functions is surveyed, and the notion of rigidity does offer for the first time a reduction of relevant computational questions to noncomputional properties.
Explicit constructions of linear size superconcentrators
  • O. Gabber, Z. Galil
  • Mathematics
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
We present an explicit construction of an infinite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.
Advances in Pebbling (Preliminary Version)
This list of papers from the 2016 ACM Symposium on the Theory of Computing and FOCS focuses on the topics of computing theory and foundations of computer science.