Talk:LibraryWithoutImplicitExportIsPolynomial

From APIDesign

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 Failed to parse (math_image_error /var/www/apidesign/httpdocs/images/tmp/d1db0d9c696a8c056e7117dbbb4ef6db.png , , /var/www/apidesign/httpdocs): 2^n ? 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)