Polynomially Correlated Knapsack is NP-complete

Details Polynomially Correlated Knapsack is NP-complete Polynomially Correlated Knapsack is NP-complete

2009-10-14

arxiv.org/abs/0910.2649v1

Computer Science

Computational Complexity

Scientific paper

0-1 Knapsack is a fundamental NP-complete problem. In this article we prove
that it remains NP-complete even when the weights of the objects in the packing
constraints and their values in the objective function satisfy specific
stringent conditions: the values are integral powers of the weights of the
objects.

Affiliated with

Also associated with

No associations

Rating

Polynomially Correlated Knapsack is NP-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomially Correlated Knapsack is NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomially Correlated Knapsack is NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19421