Results 1  10
of
51
Resolution is Not Automatizable Unless W[P] is Tractable
 IN 42ND ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 2001
"... We show that neither Resolution nor treelike Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixedparameter tractable by randomized algorithms with onesided error. ..."
Abstract

Cited by 57 (2 self)
 Add to MetaCart
We show that neither Resolution nor treelike Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixedparameter tractable by randomized algorithms with onesided error.
Pseudorandom Generators Hard for kDNF Resolution and Polynomial Calculus Resolution
, 2003
"... 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 ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
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 kDNFs instead of clauses.
On the Automatizability of Resolution and Related Propositional Proof Systems
, 2002
"... We analyse the possibility that a system that simulates Resolution is automatizable. We call this notion "weak automatizability". We prove ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
(Show Context)
We analyse the possibility that a system that simulates Resolution is automatizable. We call this notion "weak automatizability". We prove
Optimality of sizewidth tradeoffs for resolution
 Computational Complexity
, 2001
"... Abstract. This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of BenSasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence o ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
Abstract. This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of BenSasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence of our main result: we show the optimality of the general relationship called sizewidth tradeoff in BenSasson & Wigderson. Moreover we obtain the optimality of the sizewidth tradeoff for the widely used restrictions of resolution: regular, DavisPutnam, negative, positive.
Satisfiability, Branchwidth and Tseitin Tautologies
, 2002
"... For a CNF , let w b () be the branchwidth of its underlying hypergraph. ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
For a CNF , let w b () be the branchwidth of its underlying hypergraph.
On reducibility and symmetry of disjoint NPpairs
, 2001
"... . We consider some problems about pairs of disjoint NP sets. ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
. We consider some problems about pairs of disjoint NP sets.
On the Complexity of Resolution with Bounded Conjunctions
, 2004
"... We analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Krajicek in [20] which extends Resolution by allowing disjunctions of conjunctions of up to k * 1 literals. We show that the treelike Res(k) proof systems form a strict hierarchy with respect to pr ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
(Show Context)
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Krajicek in [20] which extends Resolution by allowing disjunctions of conjunctions of up to k * 1 literals. We show that the treelike Res(k) proof systems form a strict hierarchy with respect to proof size and also with respect to space. Moreover Resolution, while simulating treelike Res(k), is almost exponentially separated from treelike Res(k). To study space complexity
The Proof Complexity of Linear Algebra
 IN SEVENTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS
, 2002
"... We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the rst feasible proofs of the CayleyHamilton theorem and other properties of the determina ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the rst feasible proofs of the CayleyHamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities such as AB = I ! BA = I .
Constraint Propagation as a Proof System
 10th Int.Conf. on Principles and Practice of Constraint Programing, LN in Computer Science vol.3258
, 2004
"... Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraintsatisfaction problems. ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
(Show Context)
Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraintsatisfaction problems.