Witnessing Functions in Bounded Arithmetic and Search Problems (1994)

Cached

Download Links

by Mario Chiari , Jan Krajicek
Citations:35 - 4 self

Active Bibliography

6 A Fundamental Problem of Mathematical Logic – Jan Krajicek
21 The complexity of propositional proofs – Nathan Segerlind
18 Structure and Definability in General Bounded Arithmetic Theories – Chris Pollett - 1999
54 An application of boolean complexity to separation problems in bounded arithmetic – Samuel R. Buss, Jan Krajlcek - 1994
8 The provable total search problems of bounded arithmetic – Alan Skelley, Neil Thapen - 2007
30 Theories for Complexity Classes and their Propositional Translations – Stephen Cook - 2004
4 Count(q) versus the Pigeon-Hole Principle – Søren Riis - 1996
1 Higher complexity search problems for bounded arithmetic and – Neil Thapen - 2010
11 Count(q) does not imply Count(p) – Søren Riis - 1994
53 Lower Bounds to the Size of Constant-Depth Propositional Proofs – Jan Krajícek - 1994
1 Uniform proof complexity – Arnold Beckmann - 2005
4 Bounded-depth Frege lower bounds for weaker pigeonhole principles – Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal - 2005
2 The Complexity of Resource-Bounded Propositional Proofs – Albert Atserias - 2001
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
67 An Exponential Lower Bound to the Size of Bounded Depth Frege . . . – Jan Krajícek , Pavel Pudlák, Alan Woods - 1994
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
21 On Frege and Extended Frege Proof Systems – Jan Krajicek - 1993
Weak Pigeonhole Principle, and Randomized Computation – Emil Jerábek - 2005
86 Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic – Jan Krajícek