On Feasible Numbers (1995)

Cached

Download Links

by Vladimir Yu. Sazonov
Venue:Logic and Computational Complexity, LNCS Vol. 960
Citations:5 - 1 self

Active Bibliography

10 On Bounded Set Theory – Vladimir Yu. Sazonov
45 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
179 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
21 The complexity of propositional proofs – Nathan Segerlind
3 Combinatorics in Bounded Arithmetics – Kerry Ojakian - 2004
30 Theories for Complexity Classes and their Propositional Translations – Stephen Cook - 2004
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
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
3 Bounded Arithmetic and Constant Depth Frege Proofs – Samuel R. Buss - 2004
105 The Complexity Of Propositional Proofs – Alasdair Urquhart - 1995
7 Linear ordering on graphs, anti-founded sets and polynomial time computability – Alexei Lisitsa, Vladimir Sazonov - 1999