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
Wikidata entity: Q7977975
| P31 |
instance of |
... |
Q908207 (complexity class) |
complexity class |
| P361 |
part of |
... |
Q155291 (pseudo-polynomial time) |
pseudo-polynomial time |
| P361 |
part of |
... |
Q215206 (NP-complete) |
NP-complete |
Why not click here or view trends?
log id: 5555749