Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360): Difference between revisions
From MaRDI portal
Latest revision as of 16:21, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion |
scientific article |
Statements
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (English)
0 references
29 August 2002
0 references
toughness
0 references
hamiltonian graph theory
0 references