Browsing by Subject "Computational Complexity"
Now showing items 1-1 of 1
(Texas A&M University, 2006-10-30)Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ...