Abstract
The paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former system we show that the recently proposed algorithm of E. Ben-Sasson and A. Wigderson (1999) for searching for proofs cannot give better than weakly exponential performance. This is a consequence of showing optimality of their general relationship, referred to as size-width trade-off. We moreover obtain the optimality of the size width trade-off for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive and linear. As for the second system, we show that the direct translation to polynomials of a CNF formula having short resolution proofs, cannot be refuted in PC with degree less than /spl Omega/ (log n). A consequence of this is that the simulation of resolution by PC of M. Clegg, J. Edmonds and R. Impagliazzo (1996) cannot be improved to better than quasipolynomial in the case where we start with small resolution proofs. We conjecture that the simulation of M. Clegg et al. is optimal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
