Talk:LibraryWithoutImplicitExportIsPolynomial
From APIDesign
(Perhaps P=NP) |
|||
| (2 intermediate revisions not shown.) | |||
| Line 1: | Line 1: | ||
| - | A polynomial algorithm implies that the problem is not NP-Complete only if you assume that P != NP for which see | + | A polynomial algorithm implies that the problem is not NP-Complete only if you assume that P != NP for which see [[wikipedia:P_versus_NP_problem|P versus NP]]. |
| - | However, the important point that a known polynomial algorithm is more clearly bounded that a NP-Complete algorithm is fair enough. | + | However, the important point that a known polynomial algorithm is more clearly bounded that a [[NP-Complete]] algorithm is fair enough. |
| + | |||
| + | -- A comment from unknown reader | ||
| + | |||
| + | Nice observation ;-) Probably I am disappointed by the enthusiasm followed by total failure of P == NP proof published by Vinay Deolalikar and thus I am assuming P != NP. | ||
| + | |||
| + | Btw. now, when there is an expert reviewing my proof, I share my only worry: What if, in the process of replacing dependencies by transitive dependencies, the amount of dependencies is increased to <math>2^n</math>? That would just replace an [[NP-Complete]] problem with polynomial problem of exponential size... On the other hand, that is not likely, I guess as the transitive dependencies will contain only one version from multiple incompatible versions. | ||
| + | |||
| + | --[[User:Apidesign|Apidesign]] 18:39, 25 December 2011 (UTC) | ||
Current revision
A polynomial algorithm implies that the problem is not NP-Complete only if you assume that P != NP for which see P versus NP.
However, the important point that a known polynomial algorithm is more clearly bounded that a NP-Complete algorithm is fair enough.
-- A comment from unknown reader
Nice observation ;-) Probably I am disappointed by the enthusiasm followed by total failure of P == NP proof published by Vinay Deolalikar and thus I am assuming P != NP.
Btw. now, when there is an expert reviewing my proof, I share my only worry: What if, in the process of replacing dependencies by transitive dependencies, the amount of dependencies is increased to 2n? That would just replace an NP-Complete problem with polynomial problem of exponential size... On the other hand, that is not likely, I guess as the transitive dependencies will contain only one version from multiple incompatible versions.
--Apidesign 18:39, 25 December 2011 (UTC)
Follow
