Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 1 February 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
