8 found
Order:
  1.  97
    The Relative Efficiency of Propositional Proof Systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.
  2.  25
    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.  41
    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.
  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.  22
    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.
  6.  10
    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.  5
    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.