Abstract

To appear in Izvestiya of the RAN Abstract We show that if strong pseudorandom generators exist then the statement "ff encodes a circuit of size n(log * n) for SATISFIABILITY " is not refutable in S22 (ff). For refutation in S12 (ff), this is proven under the weaker assumption of the existence of generators secure against the attack by small depth circuits, and for another system which is strong enough to prove exponential lower bounds for constant-depth circuits, this is shown without using any unproven hardness assumptions. These results can be also viewed as direct corollaries of interpolation-like theorems for certain "split versions " of classical systems of Bounded Arithmetic introduced in this paper.

Citations

262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
169	How easy is local search - Johnson, Papadimitriou, et al. - 1988
168	The complexity of finite functions - Boppana, Sipser - 1992
167	Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985
163	Computational Limitations for Small Depth Circuits - H˚astad - 1987
152	Natural proofs - Razborov, Rudich - 1997
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
110	Feasibly constructive proofs and the propositional calculus - Cook - 1975
92	Σ 1 1-formulae on finite structures - Ajtai - 1983
85	The expressive power of voting polynomials - Aspnes, Beigel, et al. - 1994
69	Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53 - Paris, Wilkie, et al. - 1988
68	Wigderson: Monotone Circuits for Matching Require Linear Depth - Raz, A
54	The gap between monotone and nonmonotone circuit complexity is exponential - Tardos - 1988
51	An application of Boolean complexity to separation problems in bounded arithmetic - BUSS, KRAJÍČEK - 1994
45	Bounded arithmetic and lower bounds in boolean complexity - Razborov - 1993
35	On provably disjoint NP pairs - Razborov - 1994
34	Witnessing functions in bounded arithmetic and search problems - Chiari, Krajíček - 1998
26	An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic - Razborov - 1993
19	Communication Complexity: A New Approach to Circuit Depth - KARCHMER - 1989
9	A note on a theorem of Razborov - Barrington - 1986
7	Bounded existential induction - Wilmers - 1985
6	O slo��nosti realizacii line$ino$i funkcii v klasse \Pi-shem. Matem. zametki, t - Hrapqenko - 1971
5	Ninie ocenki razmera shem ograniqenno$i glubiny v polnom bazise, soderawem funkci logiqeskogo sloeni - Razborov - 1987
2	Axiomatizations and conservation results for fragments of bounded arithmetic. Contemporary Mathematics - Bibliopolis, Naples - 1986
2	O minimal~nyh kontaktno-ventil~nyh dvuhpol snikah dl monotonnyh simmetriqeskih funkci$i - Markov - 1962
2	Ob odno$i bulevsko$i funkcii - Neqiporuk - 1966
2	O realizacii line$inyh funkci$i formulami v bazise &; .; \Gamma - SubbotovskaO - 1961
2	Ob odnom metode poluqeniO/ nissnih ocenok slossnosti \Pi -shem. Matem. zametki, t - Hrapqenko - 1971
1	Si3 and ffiV i2(BD). Archive for Math. Logic - Takeuti - 1990
1	Ob odnom metode poluqeniO/ nissnih ocenok slossnosti individual~nyh monotonnyh funkci$i - Andreev - 1985
1	Ob odnom metode poluqeniO/ ffffektivnyh nissnih ocenok monotonno$i slossnosti. Algebra i logika - Andreev - 1987
1	Nissnie ocenki monotonno$i slossnosti nekotoryh bulevyh funkci$i - Razborov - 1985