|
10
|
On Bounded Set Theory
– Vladimir Yu. Sazonov
|
|
43
|
Predicative Recursion and Computational Complexity
– Stephen J. Bellantoni
- 1992
|
|
10
|
Bounded Arithmetic and Propositional Proof Complexity
– Samuel R. Buss
- 1995
|
|
8
|
Cycling in proofs and feasibility
– A. Carbone
- 1998
|
|
|
On the Lengths of Proofs of Consistency - a Survey of Results
– Pavel Pudlák
|
|
158
|
A New Recursion-Theoretic Characterization Of The Polytime Functions
– Stephen Bellantoni, Stephen Cook
- 1992
|
|
3
|
Computing on Structures
– Serge Abiteboul, Victor Vianu
|
|
4
|
Δ-Languages for Sets and LOGSPACE Computable Graph Transformers
– Alexei Lisitsa, Vladimir Sazonov
- 1997
|
|
|
Δ-Languages for Sets and LOGSPACE Computable Graph Transformers
– Alexei Lisitsa, Vladimir Sazonov
- 1997
|
|
|
Weak Pigeonhole Principle, and Randomized Computation
– Emil Jerábek
- 2005
|
|
14
|
The complexity of propositional proofs
– Nathan Segerlind
|
|
25
|
Theories for Complexity Classes and their Propositional Translations
– Stephen Cook
- 2004
|
|
2
|
Combinatorics in Bounded Arithmetics
– Kerry Ojakian
- 2004
|
|
|
unknown title
– P. V. Andreev, E. I. Gordon
- 2005
|
|
3
|
On Characterizations of the Basic Feasible Functionals Part II
– Robert J. Irwin, et al.
- 2002
|
|
|
INTRODUCTION TO THE COMBINATORICS AND COMPLEXITY OF CUT ELIMINATION
– A. Carbone, S. Semmes
|
|
79
|
Functional interpretations of feasibly constructive arithmetic
– Stephen Cook, Alasdair Urquhart
- 1993
|
|
3
|
Bounded Arithmetic and Constant Depth Frege Proofs
– Samuel R. Buss
- 2004
|
|
16
|
Bounded Hyperset Theory and Web-like Data Bases
– Alexei Lisitsa, Vladimir Sazonov
- 1997
|
