Theories for Complexity Classes and their Propositional Translations (2004)

Cached

Download Links

by Stephen Cook
Venue:Complexity of computations and proofs
Citations:30 - 7 self

Active Bibliography

Expressing vs. proving: relating forms of complexity in logic – Antonina Kolokolova
9 Quantified Propositional Calculus and a Second-Order Theory for NC¹ – Stephen Cook, Tsuyoshi Morioka - 2004
3 Combinatorics in Bounded Arithmetics – Kerry Ojakian - 2004
18 Structure and Definability in General Bounded Arithmetic Theories – Chris Pollett - 1999
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
Many facets of complexity in logic – Antonina Kolokolova
8 The provable total search problems of bounded arithmetic – Alan Skelley, Neil Thapen - 2007
1 Higher complexity search problems for bounded arithmetic and – Neil Thapen - 2010
10 The strength of replacement in weak arithmetic – Stephen Cook, Neil Thapen - 2004
2 The Complexity of Resource-Bounded Propositional Proofs – Albert Atserias - 2001
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
10 Disjoint NP-Pairs and . . . – Olaf Beyersdorff
17 A second-order system for polytime reasoning based on Grädel's theorem – Stephen Cook, Antonina Kolokolova - 2001
Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems – Stephen A. Cook
A Propositional Proof System for. . . – Chris Pollett
42 On provably disjoint NP-pairs – Alexander A. Razborov - 1994
1 Consistency and Games|in Search of New Combinatorial Principles – Pavel Pudlák - 2004
7 Saturated models of universal theories – Jeremy Avigad
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002