Talk:LibraryWithoutImplicitExportIsPolynomial
From APIDesign
(Difference between revisions)
(Perhaps P=NP) |
|||
| 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. | ||
| + | |||
| + | --[[User:Apidesign|Apidesign]] 18:39, 25 December 2011 (UTC) | ||
Revision as of 18:39, 25 December 2011
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.
--Apidesign 18:39, 25 December 2011 (UTC)
Follow
