Witnessing Functions in Bounded Arithmetic and Search Problems (1994)

Cached

Download Links

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

Documents Related by Co-Citation

54 An application of boolean complexity to separation problems in bounded arithmetic – Samuel R. Buss, Jan Krajlcek - 1994
80 Counting problems in bounded arithmetic – Jeff B Paris, Alex J Wilkie
211 Bounded Arithmetic, Propositional Logic, and Complexity Theory – J Krajíček - 1995
115 Feasibly constructive proofs and the propositional calculus – Stephen Cook - 1975
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
31 Quanti propositional calculi and fragments of Bounded Arithmetic, Zeitschrift f. math. Logik und Grundlagen d – J Krajcek, P Pudlak - 1990
58 Notes on Polynomially Bounded Arithmetic – Domenico Zambella
27 Relating the Bounded Arithmetic and Polynomial Time Hierarchies – Samuel R. Buss, Then T - 1994
330 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
27 Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic – Samuel R. Buss - 1990
55 The relative complexity of NP search problems – Paul Beame, Stephen Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi - 1997
57 Bounded arithmetic and the polynomial hierarchy – J Krajíček, P Pudlák, G Takeuti - 1991
14 Boolean programs and quantified propositional proof systems – Stephen Cook, Michael Soltys - 1999
14 Lifting Independence Results in Bounded Arithmetic – Mario Chiari, Jan Krajicek - 1999
71 A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes – J B Paris, A J Wilkie, Woods - 1988
123 Exponential lower bounds for the pigeonhole principle – Paul W Beame, Toniann Pitassi, Russel Impagliazzo - 1993
67 An Exponential Lower Bound to the Size of Bounded Depth Frege . . . – Jan Krajícek , Pavel Pudlák, Alan Woods - 1994
69 On the Weak Pigeonhole Principle – Jan Krajícek - 2001
84 Pudlák: Propositional proof systems, the consistency of first order theories and the complexity of computations – J Krajíček, P - 1989