Minimum propositional proof length is NP-hard to linearly approximate (Q2732273)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum propositional proof length is NP-hard to linearly approximate |
scientific article; zbMATH DE number 1623516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum propositional proof length is NP-hard to linearly approximate |
scientific article; zbMATH DE number 1623516 |
Statements
Minimum propositional proof length is NP-hard to linearly approximate (English)
0 references
21 January 2002
0 references
lower bounds
0 references
resolution refutations
0 references
minimum propositional proof length
0 references
Frege systems
0 references
resolution
0 references
polynomial calculus
0 references
sequent calculus
0 references
hardness of approximation
0 references
0.8687665
0 references
0.8686994
0 references
0.86724627
0 references
0.86682165
0 references
0.8603777
0 references
0.8594843
0 references
0.85503227
0 references
