Minimum propositional proof length is NP-Hard to linearly approximate

Journal of Symbolic Logic 66 (1):171-191 (2001)
Abstract
We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log 1 - o(1) n . These results are very robust in that they hold for almost all natural proof systems, including: Frege systems, extended Frege systems, resolution, Horn resolution, the polynomial calculus, the sequent calculus, the cut-free sequent calculus, as well as the polynomial calculus. Our hardness of approximation results usually apply to proof length measured either by number of symbols or by number of inferences, for tree-like or dag-like proofs. We introduce the Monotone Minimum (Circuit) Satisfying Assignment problem and reduce it to the problems of approximation of the length of proofs.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2694916
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,865
Through your library

References found in this work BETA

Some Remarks on Lengths of Propositional Proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.

Add more references

Citations of this work BETA

Towards–Via Proof Complexity and Search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
Towards NP – P Via Proof Complexity and Search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
212 ( #25,126 of 2,293,801 )

Recent downloads (6 months)
4 ( #137,650 of 2,293,801 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature