18 results on '"Stephen A. Cook"'
Search Results
2. The relative complexity of NP search problems.
3. A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)
4. Proving Assertions about Programs that Manipulate Data Structures
5. Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract)
6. Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version)
7. A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
8. Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space
9. Storage Requirements for Deterministic Polynomial Time Recognizable Languages
10. Time-Bounded Random Access Machines
11. A Hierarchy for Nondeterministic Time Complexity
12. On the Number of Additions to Compute Specific Polynomials (Preliminary Version)
13. The Complexity of Theorem-Proving Procedures
14. An Observation on Time-Storage Trade Off
15. On the Lengths of Proofs in the Propositional Calculus (Preliminary Version)
16. Bounds on the Time for Parallel RAM's to Compute Simple Functions
17. Path Systems and Language Recognition
18. Variations on Pushdown Machines (Detailed Abstract)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.