isWeaklyNPComplete
P161756
predicate
Indicates that a problem belongs to the class of NP-complete problems whose hardness relies on large numerical parameters, and which may admit pseudo-polynomial-time algorithms.
Sample triples (1)
| Subject | Object |
|---|---|
| Subset sum problem | true ⓘ |