The Euclidean traveling salesman problem is NP-complete (Q1250163): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56067404, #quickstatements; #temporary_batch_1706332928950 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56067404 / rank | |||
Normal rank | |||
Revision as of 06:27, 27 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Euclidean traveling salesman problem is NP-complete |
scientific article |
Statements
The Euclidean traveling salesman problem is NP-complete (English)
0 references
1977
0 references
