Definitions from Wikipedia (Weak NP-completeness)

▸ noun:  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.


▸ Words similar to weak np-completeness
▸ Usage examples for weak np-completeness

▸ Idioms related to weak np-completeness
▸ Wikipedia articles (New!)
▸ Words that often appear near weak np-completeness
▸ Rhymes of weak np-completeness

▸ Invented words related to weak np-completeness