The complexity of theorem-proving procedures
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propo...
Publications
2 shownCharacterizations of Pushdown Machines in Terms of Time-Bounded Computers
article Free AccessCharacterizations of Pushdown Machines in Terms of Time-Bounded Computers Author: Stephen A. Cook Department of Computer Science, University of Toronto, Toron...
Researcher Info
- h-index
- 2
- Publications
- 2
- Citations
- 6,463
- Institution
- University of Toronto
External Links
Impact Metrics
h-index
2
h-index: Number of publications with at least h citations each.