Solving traveling salesman problem in the Adleman-Lipton model (Q2250259): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2012.08.073 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021994503 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: DNA ternary addition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A DNA procedure for solving the shortest path problem / rank | |||
Normal rank | |||
Latest revision as of 18:09, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving traveling salesman problem in the Adleman-Lipton model |
scientific article |
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
