Short proofs are narrow - resolution made simple

Eli Ben-Sasson*, Avi Wigderson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

The width of a Resolution proof is the maximal number of literals in any clause of the proof. In this work, proof width is related to proof size, both in general Resolution, and its tree-like variant. The main result is a relation between these two fundamental resources.

Original languageEnglish
Title of host publicationProceedings of the Annual IEEE Conference on Computational Complexity
PublisherIEEE Comp Soc
Pages2
Number of pages1
ISBN (Print)0769500757
StatePublished - 1999
EventProceedings of the 1999 14th Annual IEEE Conference on Computational Complexity - Atlanta, GA, USA
Duration: 4 May 19996 May 1999

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)1093-0159

Conference

ConferenceProceedings of the 1999 14th Annual IEEE Conference on Computational Complexity
CityAtlanta, GA, USA
Period4/05/996/05/99

Fingerprint

Dive into the research topics of 'Short proofs are narrow - resolution made simple'. Together they form a unique fingerprint.

Cite this