Abstract

A pseudorandom generator G n : f0; 1g is hard for a propositional proof system P if (roughly speaking) P can not ef- ciently prove the statement G n (x 1 ; : : : ; x n ) 6= b for any string b 2 . We present a function (m 2 ) generator which is hard for Res( log n); here Res(k) is the propositional proof system that extends Resolution by allowing k-DNFs instead of clauses.

Citations

544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
453	Theory and applications of trapdoor functions - Yao - 1982
250	Hardness vs. Randomness - Nisan, Wigderson - 1988
167	The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization - Alon, Spencer - 2008
152	Natural proofs - Razborov, Rudich - 1997
120	bounds for resolution and cutting plane proofs and monotone computations - Pudlák, “Lower - 1997
90	Simplified and improved resolution lower bounds, in - Beame, Pitassi - 1996
90	The complexity of propositional proofs - Urquhart - 1995
84	Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability - Clegg, Edmons, et al. - 1996
76	CREW PRAMs and decision trees - Nisan - 1991
71	Lower Bounds for Cutting Planes Proofs with Small Coefficients - Bonet, Pitassi, et al. - 1997
67	Some consequences of cryptographic conjectures for S 1 2 and EF - Krajíček, Pudlák - 1995
64	Propositional proof complexity: Past, present, and future - Beame, Pitassi - 2001
51	Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic - Razborov - 1995
50	On the complexity of a concentrator - Pinsker - 1973
46	Resolution Lower Bounds for the Weak Pigeonhole Principle. Found at Electronic Col-loqium on Computational Complexity, Reports Series 2001, Available at http://www.eccc.unitrier.de/eccc - Raz - 1983
46	Lower bounds for the polynomial calculus - Razborov - 1998
45	The length of proofs - Pudlák - 1998
45	Bounded arithmetic and lower bounds in boolean complexity - Razborov - 1993
44	On Interpolation and Automatization For Frege Systems - Bonet, Pitassi, et al.
44	search of an easy witness: exponential time vs. probabilistic polynomial time - Impagliazzo, Kabanets, et al.
42	Poisson approximation for large deviations, Random Structures and Algorithms 1 - Janson - 1990
41	A switching lemma for small restrictions and lower bounds for k-DNF resolution - Segerlind, Buss, et al. - 2004
40	Resolution lower bounds for perfect matching principles - Razborov
35	Space complexity in proposi-tional calculus - Alekhnovich, Ben-Sasson, et al. - 2000
30	Lower bounds for polynomial calculus: Non-binomial case - Alekhnovich, Razborov - 2003
27	Linear gaps between degrees for the polynomial calculus modulo distinct primes - Buss, Grigoriev, et al. - 1999
26	Candidate One-Way Functions Based on Expander - Goldreich - 2000
26	bounds for propositional proofs and independence results in bounded arithmetic - Razborov, Lower - 1996
25	Bounded Arithmetic, Propositional Logic and Complexity Theory - Krajcek - 1996
21	Randomness conductors and constant-degree expansion beyond the degree/2 barrier - Capalbo, Reingold, et al. - 2002
14	Using the Groebner basis algorithm to proofs of unsatis - Clegg, Edmonds, et al. - 1996
12	Pseudorandom generators in propositional complexity - Alekhnovich, Ben-Sasson, et al. - 2000
12	Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic - Krajcek - 1997
8	On the weak pigeonhole principle - Krajcek - 2001
8	Proof complexity of pigeonhole principles - Razborov - 2002
6	Random CNF"s are Hard for the Polynomial Calculus - Ben-Sasson, Impagliazzo - 1998
3	Lower bounds to the size of constant-depth propositional proofs - Krajcek - 1994
2	Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus - Krajcek - 1997
2	Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds - Krajcek - 2002
1	Tautologies from pseudo-random generators - Krajcek - 2001