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

First Page		Document Content
Date: 2010-09-08 02:56:32 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 Source URL: www.piercelab.caltech.edu Download Document from Source Website File Size: 112,52 KB Share Document on Facebook

	Journal of Global Optimization manuscript No. (will be inserted by the editor) Stabilizer-based symmetry breaking constraints for mathematical programs Leo Liberti · James Ostrowski DocID: 1v0h9 - View Document
	OPTIMA 88 Mathematical Optimization Society Newsletter Philippe L. Toint MOS Chair’s Column DocID: 1uTp0 - View Document
	The Annals of Probability 2004, Vol. 32, No. 1B, 1030–1067 © Institute of Mathematical Statistics, 2004 A STOCHASTIC REPRESENTATION THEOREM WITH APPLICATIONS TO OPTIMIZATION AND OBSTACLE PROBLEMS DocID: 1sOP9 - View Document
	Optimization of Electrical Production The production of electricity in France is optimized everyday with the help of a mathematical software developed at Inria, in collaboration with EDF R&D. Substantial performance is a DocID: 1rxID - View Document
	Timed-Elastic-Bands for Time-Optimal Point-To-Point Nonlinear Model Predictive Control DocID: 1ru4i - View Document