8 found
Order:
  1. The relative efficiency of propositional proof systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.
  2.  32
    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.
  3.  23
    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.
  4.  9
    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.
  5.  52
    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.
  6.  13
    Tag Systems and Lag Systems.Hao Wang, John Cocke, Marvin Minsky & Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):344-344.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  8
    Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.
  8.  7
    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.