Review on Combinatorial Optimization and Computational Complexity

Jiqiang Wang · Computer Knowledge and Technology · 2013

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.

Read the paper · More papers on PaperTik