Pages that link to "Item:Q815653"
From MaRDI portal
The following pages link to New algorithms for some NP-optimization problems by DNA computing (Q815653):
Displaying 7 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- A polynomial-time DNA computing solution for the bin-packing problem (Q1039671) (← links)
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (Q1853479) (← links)
- A new DNA algorithm to solve graph coloring problem (Q2644715) (← links)
- (Q3641015) (← links)
- Computational and Information Science (Q5491588) (← links)