Pages that link to "Item:Q1276167"
From MaRDI portal
The following pages link to DNA models and algorithms for NP-complete problems (Q1276167):
Displaying 6 items.
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Is DNA computing viable for 3-SAT problems? (Q1401219) (← links)
- DNA2DNA computations: A potential “killer app”? (Q4571939) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
