M. L. Bonet, T. Pitassi, and R. Raz. On Interpolation and Automatization for Frege Systems. SIAM Journal on Computing, 29(6):1939. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
....and finally became known as E#cient Interpolation Property (EIP in what follows) EIP was shown to be true for some weak proof systems and it was also remarked that for every proof system (be it weak or strong) EIP implies conditional lower bounds. Unfortunately, it turned out rather soon [KP98, BPR00] that neither Frege nor Extended Frege have E#cient Interpolation modulo (somewhat ironically) hardness assumptions of the same sort that are needed to prove conditional lower bounds for proof systems with EIP. This omnipresent hardness assumption is nothing else as the existence of pseudorandom ....
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939--1967, 2000.
Resolution is Not Automatizable Unless W[P] is Tractable - Alekhnovich, Razborov (2001) (7 citations) (Correct)
....ecient interpolation theorems; we refer the reader to the excellent survey [BP98] for more details about this and also as to a good starting point for learning more about propositional proof complexity in general. One convenient framework for the theoretical study of Question 2 was proposed in [BPR00] Namely, they called a proof system P automatizable if there exists a deterministic algorithm A which, given a tautology , returns its P proof in time polynomial in the size of the shortest P proof of . The de nition of a quasi automatizable proof system is given in the same way, but we ....
....comes from the connection between automatizability and ecient interpolation (every automatizable proof system has ecient interpolation, and the property of having ecient interpolation is indeed anti monotone w.r.t. the strength of the system) Anyway, given this connection, the results from [KP98, BPR00] imply that Extended Frege and TC Frege proof systems respectively are not automatizable assuming some widely believed cryptographic assumptions. BDG 99] extended the latter result to bounded depth Frege but under a much stronger assumption. We are primarily interested in the ....
[Article contains additional citation context not shown here]
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939-1967, 2000.
Satisfiability, Branch-width and Tseitin Tautologies - Alekhnovich, Razborov (2002) (1 citation) (Correct)
....a deterministic algorithm which on every CNF runs in time polynomial in j j 2 w b ( and: 1. returns its regular resolution refutation of width O(w b ( if is unsatis able; 2. returns a satisfying assignment if is satis able. Recall the general de nition of automatizability from [BPR00]. We give it here only for the special cases of Resolution; on the other hand, it is presented for arbitrary classes of unsatis able CNFs (as opposed to the class of all unsatis able CNFs in [BPR00] De nition 2.3 A class C of unsatis able CNFs is (quasi )automatizable (with respect to ....
....satisfying assignment if is satis able. Recall the general de nition of automatizability from [BPR00] We give it here only for the special cases of Resolution; on the other hand, it is presented for arbitrary classes of unsatis able CNFs (as opposed to the class of all unsatis able CNFs in [BPR00]) De nition 2.3 A class C of unsatis able CNFs is (quasi )automatizable (with respect to Resolution) if there exists a deterministic automatizing algorithm that, given an unsatis able CNF 2 C, returns its resolution refutation in time which is (quasi )polynomial in j j S( Note that ....
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939-1967, 2000.
VTC0: A Second-Order Theory for TC0 - Nguyen, Cook (Correct)
No context found.
M. L. Bonet, T. Pitassi, and R. Raz. On Interpolation and Automatization for Frege Systems. SIAM Journal on Computing, 29(6):1939.
Satisfiability, Branch-width and Tseitin Tautologies - Razborov (2002) (1 citation) (Correct)
No context found.
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939-1967, 2000.
On the Complexity of Resolution with Bounded Conjunctions - Esteban, Galesi, Messner (2004) (5 citations) (Correct)
No context found.
M.L. Bonet, T. Pitassi, R. Raz. On interpolation and automatization for Frege systems. SIAM J. Comput. 29(6) pp. 1939.
Polynomial-size Frege and Resolution Proofs of st-Connectivity and .. - Buss (2003) (2 citations) (Correct)
No context found.
M. L. Bonet, T. Pitassi, and R. Raz, On interpolation and automatization for Frege systems, SIAM Journal on Computing, 29 (2000.
Feasible Proofs and Computations: Partnership and Fusion - Alexander Razborov Institute (Correct)
No context found.
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939.
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
No context found.
M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939-1967, 2000.
The Proof Complexity of Linear Algebra - Michael Soltys And (2002) (Correct)
No context found.
M. L. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for frege systems. SIAM J. on Computing, 29:1939-1967, 2000.
Polynomial-size Frege and Resolution Proofs of st-Connectivity and .. - Buss (2003) (2 citations) (Correct)
No context found.
M. L. Bonet, T. Pitassi, and R. Raz, On interpolation and automatization for Frege systems, SIAM Journal on Computing, 29 (2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC