Login / Signup

A general resolution of intractable problems in polynomial time through DNA Computing.

Carlos Alberto Alonso SanchesNei Yoshihiro Soma
Published in: Biosyst. (2016)
Keyphrases
  • dna computing
  • special case
  • np complete
  • polynomially solvable
  • high resolution
  • computational complexity
  • greedy algorithm
  • specific problems