Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem

Details Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem

2008-05-05

arxiv.org/abs/0805.0517v5

Computer Science

Computational Complexity

14 Pages; The author is delaying submission for publication so that counter arguments may be proposed. ftp://ftp%40micrognu%

Scientific paper

Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete problem in deterministic polynomial time. It has also been demonstrated that finding such a partition can only be done in deterministic polynomial time if the form of the problem provides a simple method for producing the partition. It is the purpose of this article to demonstrate that no deterministic polynomial time method exists to produce a representative polynomial search partition for the Knapsack problem.

Affiliated with

Also associated with

No associations

Rating

Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem 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 Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208838