Minimum propositional proof length is NP-hard to linearly approximate (Q2732273): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3002852 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relative efficiency of propositional proof systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks on lengths of propositional proofs / rank | |||
Normal rank | |||
Latest revision as of 17:42, 3 June 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
