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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| pseudoPolynomialTime canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: pseudoPolynomialTime
Generated description
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 ⓘ |