Topic summary
Weakly NP-complete
Extracted from the Wikipedia article Weak NP-completeness.
In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard) if there is an algorithm for the problem whose running time is polynomial in the dimension of the problem and the magnitudes of the data involved (provided these are given as integers), rather than the base-two logarithms of their magnitudes. Such algorithms have running times that are exponential functions of their input size and are therefore not considered polynomial