Minimum propositional proof length is NP-hard to linearly approximate (Q2732273): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2694916 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006906201 / rank | |||
Normal rank | |||
Revision as of 02:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum propositional proof length is NP-hard to linearly approximate |
scientific article |
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
