|
10
|
Bounded Arithmetic and Propositional Proof Complexity
– Samuel R. Buss
- 1995
|
|
6
|
Relating the Provable Collapse of P to NC¹ and the Power of Logical Theories
– Stephen Cook
|
|
34
|
Witnessing Functions in Bounded Arithmetic and Search Problems
– Mario Chiari, Jan Krajicek
- 1994
|
|
6
|
A Fundamental Problem of Mathematical Logic
– Jan Krajicek
|
|
5
|
On Feasible Numbers
– Vladimir Yu. Sazonov
- 1995
|
|
10
|
On Bounded Set Theory
– Vladimir Yu. Sazonov
|
|
158
|
A New Recursion-Theoretic Characterization Of The Polytime Functions
– Stephen Bellantoni, Stephen Cook
- 1992
|
|
14
|
The complexity of propositional proofs
– Nathan Segerlind
|
|
|
Weak Pigeonhole Principle, and Randomized Computation
– Emil Jerábek
- 2005
|
|
8
|
Tailoring Recursion for Complexity
– Erich Grädel, Yuri Gurevich
- 1995
|
|
11
|
Theories With Self-Application and Computational Complexity
– Thomas Strahm
- 2002
|
|
38
|
The History and Status of the P versus NP Question
– Michael Sipser, Juris Hartmanis
- 1992
|
|
4
|
Count(q) versus the Pigeon-Hole Principle
– Søren Riis
- 1996
|
|
25
|
Theories for Complexity Classes and their Propositional Translations
– Stephen Cook
- 2004
|
|
90
|
The Complexity Of Propositional Proofs
– Alasdair Urquhart
- 1995
|
|
3
|
Computing on Structures
– Serge Abiteboul, Victor Vianu
|
|
33
|
Fixpoint Logics, Relational Machines, and Computational Complexity
– Serge Abiteboul, Moshe Y. Vardi, Victor Vianu
- 1993
|
|
2
|
Combinatorics in Bounded Arithmetics
– Kerry Ojakian
- 2004
|
|
74
|
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic
– Jan Krajícek
|
