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 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.