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.
Cite
CITATION STYLE
APA
Paul, W. J., & Reischuk, R. (1979). A graph theoretic approach to determinism versus non-determinism: Short preliminary version. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 67 LNCS, pp. 222–232). Springer Verlag. https://doi.org/10.1007/3-540-09118-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free