Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. [electronic resource]
Producer: 20050705Description: 71-82 p. digitalISSN:- 0303-2647
No physical items for this record
Publication Type: Evaluation Study; Journal Article; Research Support, Non-U.S. Gov't
There are no comments on this title.
Log in to your account to post a comment.