weak NP-completeness
set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes
Press Enter · cited answer in seconds
0 sources
weak NP-completeness
Summary
weak NP-completeness is a complexity class[1]. It draws 3 Wikipedia views per month (complexity_class category, ranking #41 of 61).[2]
Key Facts
- weak NP-completeness's instance of is recorded as complexity class[3].
- weak NP-completeness's part of is recorded as NP-complete[4].
- weak NP-completeness's part of is recorded as pseudo-polynomial time[5].
Why It Matters
weak NP-completeness draws 3 Wikipedia views per month (complexity_class category, ranking #41 of 61).[2]