Talk:LibraryWithoutImplicitExportIsPolynomial
From APIDesign
(Difference between revisions)
Revision as of 08:35, 23 December 2011
A polynomial algorithm implies that the problem is not NP-Complete only if you assume that P != NP for which see http://en.wikipedia.org/wiki/P_versus_NP_problem.
However, the important point that a known polynomial algorithm is more clearly bounded that a NP-Complete algorithm is fair enough.
Follow
