Browsing by Subject "Enumeration"
Now showing items 1-1 of 1
-
(2011-08-08)NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However since many NP-Hard problems are of ...