1. 首页
  2. 人工智能
  3. 机器学习
  4. ComputersandIntractability:AGuidetotheTheoryofNP-Completeness

ComputersandIntractability:AGuidetotheTheoryofNP-Completeness

上传者: 2019-05-19 23:29:17上传 PDF文件 13.04MB 热度 17次
Fewtechnicaltermshavegainedsuchrapidnotorietyastheappela-tionHNP-complete."Intheshorttimesinceitsintroductionintheearly1970's,thistermhascometosymbolizetheabyssofinherentintractabilitythatalgorithmdesignersincreasinglyfaceastheyseektosolvelargerandmorecomplexproblems.A
用户评论