Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / NP-complete problems / Structural complexity theory / NP-hard / NP-complete / Dead-end elimination / NP / P / Theoretical computer science / Computational complexity theory / Applied mathematics


Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied
Add to Reading List

Document Date: 2010-09-08 02:56:32


Open Document

File Size: 112,52 KB

Share Result on Facebook
UPDATE