Advertisement

Speeding-up single-tape nondeterministic computations by single alternation, with separation results

  • Jiří Wiedermann
Session 8: Complexity Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)

Abstract

It is shown that for any well behaved function T(n), any single-tape nondeterministic Turing Machine of time complexity T(n) can be simulated by a single-tape Σ2-machine in time T(n)/logT(n). A similar result holds also for complementary, single-tape co-nondeter-ministic and II2machines. Consequently, NTIME1(T(n)) is strictly contained in Σ2-TIME1(T(n)), and analogously co-TIME1(T(n)) in II2-TIME1(T(n)), i.e., for single tape nondeterministic or co-nondeterministic machines adding of one more alternation leads to provably more powerful machines.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gupta, S.: Alternating Time Versus Deterministic Time: A Separation. Proc. of Structure in Complexity, San Diego, 1993Google Scholar
  2. 2.
    Hopcroft, J. — Paul, W. — Valiant L.: On time versus space and related problems. Proc. IEEE FOCS 16, 1975, pp. 57–64Google Scholar
  3. 3.
    Kannan, R.: Alternation and the power of nondeterminism (Extended abstract). Proc. 15-th STOC, 1983, pp. 344–346Google Scholar
  4. 4.
    Li, M. — Neuféglise, H. — Torenvliet, L. — van Emde Boas, P.: On Space Efficient Simulations. ITLI Prepublication Series, CS-89-03, University of Amsterdam, 1989Google Scholar
  5. 5.
    Lorys, K. — Liskiewicz, M.: Two Applications of Führers Counter to One-Tape Nondeterministic TMs. Proceedings of the MFCS'88, LNCS Vol. 324, Springer Verlag, 1988, pp. 445–453Google Scholar
  6. 6.
    Maass, W. — Schorr, A.: Speed-up of Turing Machines with One Work Tape and Two-way Input Tape. SIAM J. Comput., Vol. 16, no. 1, 1987, pp. 195–202CrossRefGoogle Scholar
  7. 7.
    Paterson, M.: Tape Bounds for Tape-Bounded Turing Machines, JCSS, Vol. 6, 1972, pp. 115–124Google Scholar
  8. 8.
    Paul, W. — Pippenger, E. — Szemeredi, E. — Trotter, W.: On Determinism versus Nondeterminism and Related Problems. Proc. 24-th FOCS, 1983, pp. 429–438Google Scholar
  9. 9.
    Paul, W. — Prauss, E. J. — Reischuk, R.: On Alternation. Acta, Informatica, 14, 1980, pp. 243–255Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jiří Wiedermann
    • 1
  1. 1.Institute of Computer ScienceAcademy of Sciences of the Czech RepublicPragueCzech Republic

Personalised recommendations