Solving traveling salesman problem in the Adleman-Lipton model (Q2250259)
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: Solving traveling salesman problem in the Adleman-Lipton model |
scientific article; zbMATH DE number 6313535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving traveling salesman problem in the Adleman-Lipton model |
scientific article; zbMATH DE number 6313535 |
Statements
Solving traveling salesman problem in the Adleman-Lipton model (English)
0 references
4 July 2014
0 references
DNA computing
0 references
the traveling salesman problem
0 references
Adleman-Lipton model
0 references
NP-complete problem
0 references
0.855547308921814
0 references
0.7833307385444641
0 references
0.7535416483879089
0 references
0.7497636079788208
0 references
