摘要
综合论述了组合最优化理论与计算复杂性理论,尤其是NP-完备理论之间的密切关系,揭示出NP-完备理论研究的重大理论和现实意义。
The close relationship between theory of combinatorial optimization and theory of computational complexity,especially theory of NP-complete,is reviewed,and significant theoretical and practical importance for theory of NP-complete is discussed.
作者
王继强
WANG Ji-qiang（School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,China）
出处
《电脑知识与技术》
2013年第5期3140-3141,共2页
Computer Knowledge and Technology
基金
山东省自然科学基金（ZR2011FQ024）资助
关键词
组合最优化
计算复杂性
NP-完备
近似算法
Combinatorial Optimization
Computational Complexity
NP-complete
Approximation Algorithm
