Solving NP-hard semirandom graph problems in polynomial expected time (Q3437092)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving NP-hard semirandom graph problems in polynomial expected time |
scientific article |
Statements
Solving NP-hard semirandom graph problems in polynomial expected time (English)
0 references
14 May 2007
0 references
