Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.

Cook's Theorem [Cormen, T.H., Leiserson, C.