List Question
10 TechQA 2015-06-24 10:50:12NP-hard algorithm
1k views
Asked by ali khorshidi rozbahani
example of reduction a polynomial decision to an NP-complete
990 views
Asked by user3070752
NP-Complete VS NP-Hard
22.4k views
Asked by ade19
Is longest possibly non-simple path in NP?
1.2k views
Asked by Pafnuty
Parabolic knapsack
1.8k views
Asked by rook
Are there any decision problems in NP-Hard whose solution is not verifiable in polynomial time?
410 views
Asked by hareendra reddy
How to schedule different types of planks to form bridges
150 views
Asked by wzb5210
Recursively finding all partitions of a set of n objects into k non-empty subsets
807 views
Asked by Kornel_S
Np-hardness reduction
453 views
Asked by Mads Andersen
Complexity measurement of NP-complete
322 views
Asked by kostio