Advertisement

A graph theoretic approach to determinism versus non-determinism

Short preliminary version
  • W. J. Paul
  • R. Reischuk
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Abstract

A graph theoretic conjecture which implies lower bounds for the difficulty of certain computational tasks is discussed. A graph theoretic result related to this conjecture is proven. Alternation is shown to increase the power of multitape Turing machines.

Keywords

Turing Machine Computation Graph Open Path Graph Theoretic Approach Complete Binary Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [CS]
    A. Chandra and L. Stockmeyer: Alternation 17th IEEE-FOCS, 98–108, 1976Google Scholar
  2. [EGS]
    P. Erdös, R. Graham and E. Szemeredi: Sparse graphs with nse long paths Stan-CS-75-504, Computer Science Dept., Stanford University, 1975Google Scholar
  3. [HPV]
    J. Hopcroft, W. Paul and L. Valiant: On time versus space J. ACM 24, 332–337, 1977CrossRefGoogle Scholar
  4. [LT]
    R. Lipton and R. Tarjan: Applications of a planar separator theorem 18th IEEE-FOCS, 162–170, 1977Google Scholar
  5. [P]
    N. Pippenger: Superconcentrators PreprintGoogle Scholar
  6. [PF]
    N. Pippenger and M. Fischer: Relations among complexity measures PreprintGoogle Scholar
  7. [PT]
    W. Paul and R. Tarjan: Time-space trade-offs in a pebble game To appear in Acta InformaticaGoogle Scholar
  8. [PTC]
    W. Paul, R. Tarjan and J. Celoni: Space bounds for a game on graphs Math. Syst. Theory, 10, 239–251. 1977CrossRefGoogle Scholar
  9. [RF]
    Ruby and P. Fischer: Translational methods and computational complexity IEEE-SWAT 1965, 173–178Google Scholar
  10. [S]
    C.P. Schnorr: The network complexity and the Turing complexity of finite functions Acta Informatica 7, 95–107, 1976CrossRefGoogle Scholar
  11. [V75]
    L. Valiant: On non-linear lower bounds in computational complexity 7th ACM-SOC, 45–53, 1975Google Scholar
  12. [BGW]
    R.V. Book, S.A. Greibach and B. Wegbreit: Time and tape bounded Turing acceptors and AFL's. J. CSS 4, 606–621, 1970Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • W. J. Paul
  • R. Reischuk

There are no affiliations available

Personalised recommendations