The following pages link to Stephen A. Cook (Q1096389):
Displaying 36 items.
- (Q685961) (redirect page) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- A feasibly constructive lower bound for resolution proofs (Q915457) (← links)
- Short propositional formulas represent nondeterministic computations (Q1096390) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Towards a complexity theory of synchronous parallel computation (Q1158753) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- An observation on time-storage trade off (Q1217591) (← links)
- Storage requirements for deterministic polynomial time recognizable languages (Q1230508) (← links)
- The relative complexity of NP search problems (Q1273858) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- A hierarchy for nondeterministic time complexity (Q1394124) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Time bounded random access machines (Q1844708) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Characterizations of ordinal numbers in set theory (Q2524563) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
- Complexity theory for operators in analysis (Q2875177) (← links)
- Formalizing Randomized Matching Algorithms (Q2904622) (← links)
- A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (Q2915696) (← links)
- Fractional pebbling and thrifty branching programs (Q2920118) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- Pebbles and Branching Programs for Tree Evaluation (Q2947557) (← links)
- Complexity Theory for Operators in Analysis (Q2947565) (← links)
- (Q2958529) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- (Q3311653) (← links)
- The recognition of deterministic CFLs in small time and space (Q3319777) (← links)
- (Q3373046) (← links)
- Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs (Q4598173) (← links)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (Q4649532) (← links)
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (Q5138372) (← links)
- Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705) (← links)
