A graph theoretic approach to determinism versus non-determinism
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.
KeywordsTuring Machine Computation Graph Open Path Graph Theoretic Approach Complete Binary Tree
Unable to display preview. Download preview PDF.
- [CS]A. Chandra and L. Stockmeyer: Alternation 17th IEEE-FOCS, 98–108, 1976Google Scholar
- [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
- [LT]R. Lipton and R. Tarjan: Applications of a planar separator theorem 18th IEEE-FOCS, 162–170, 1977Google Scholar
- [P]N. Pippenger: Superconcentrators PreprintGoogle Scholar
- [PF]N. Pippenger and M. Fischer: Relations among complexity measures PreprintGoogle Scholar
- [PT]W. Paul and R. Tarjan: Time-space trade-offs in a pebble game To appear in Acta InformaticaGoogle Scholar
- [RF]Ruby and P. Fischer: Translational methods and computational complexity IEEE-SWAT 1965, 173–178Google Scholar
- [V75]L. Valiant: On non-linear lower bounds in computational complexity 7th ACM-SOC, 45–53, 1975Google Scholar
- [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