Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360)
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: Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion |
scientific article; zbMATH DE number 1792308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion |
scientific article; zbMATH DE number 1792308 |
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
0.763094425201416
0 references
0.7540268898010254
0 references
0.7529626488685608
0 references
