San Francisco / Clarke / Cambridge / Pasadena / L.A. / New York / Wiley / Freeman / /
Company
Oxford University Press / S.L. and PierceN.A. / MIT Press / Plenum Press / Air Force Research Laboratory / PierceN.A. / Defense 781 N.A. / CookS.A. / MarshallS.A. / /
Country
United States / / /
Facility
Prentice Hall / California Institute of Technology / /
IndustryTerm
search method / deterministic algorithms / energy function / polynomial-time algorithms / excellent solutions / exponential-time algorithms / graphical belief networks / elusive using exact algorithms / free energy / polynomial-space algorithms / genetic algorithms / polynomial-time algorithm / exponential-time algorithm / minimum energy conformation / stochastic local search algorithms / exhaustive search / energy / /
Organization
California Institute of Technology / E.Winfree Advanced Research Projects Agency / Burroughs-Wellcome Foundation / MIT / N.A.Pierce and E.Winfree Advanced Research Projects Agency / Association of Computing Machinery / Oxford University / J. Assoc. / /
Person
Thatcher / Gordon / Mayo / /
Position
physical model / Representative / salesman / /
Product
Nokia N75 Smartphone / /
ProgrammingLanguage
TSP / /
ProvinceOrState
North Dakota / California / New York / Massachusetts / /
PublishedMedium
the Theory of Computing / /
Technology
exponential-time algorithms / Protein Engineering / corresponding algorithms / polynomial-time algorithms / polynomial-space algorithms / polynomial-time algorithm / exponential-time algorithm / known algorithm / stochastic local search algorithms / /
Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied