pseudoPolynomialTime
P161757
predicate
Indicates that the time complexity of an algorithm is polynomial in the numeric value of the input (e.g., the magnitude of numbers) rather than in the length of the input’s encoding.
Sample triples (1)
| Subject | Object |
|---|---|
| Subset sum problem | true ⓘ |