Order:
Order
- The Relative Efficiency of Propositional Proof Systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.details
- Alan Cobham. The Intrinsic Computational Difficulty of Functions. Logic, Methodology and Philosophy of Science, Proceedings of the 1964 International Congress, Edited by Yehoshua Bar-Hillel, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam1965, Pp. 24–30. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657.details
- Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-657.details
- Manuel Blum. A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 322–336. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.details
- Bečvář Jiří. Real-Time and Complexity Problems in Automata Theory. English with Czech Summary. Kybernetika , Vol. 1 , Pp. 475–498. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.details
- Tag Systems and Lag Systems.Hao Wang, John Cocke, Marvin Minsky & Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):344-344.details
- Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.details
- Review: Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.details
|
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
 Email
|
 RSS feed
|
|
