parameterizedComplexity
P162024
predicate
Indicates that the relationship or action is analyzed or characterized in terms of its computational complexity as a function of one or more explicit parameters.
All labels observed (2)
| Label | Occurrences |
|---|---|
| complexityDependsOn | 9 |
| parameterizedComplexity 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: parameterizedComplexity
Generated description
Indicates that the relationship or action is analyzed or characterized in terms of its computational complexity as a function of one or more explicit parameters.
Sample triples (10)
| Subject | Object |
|---|---|
| Euclidean algorithm for polynomials | degrees of the input polynomials via predicate surface "complexityDependsOn" ⓘ |
| Euclidean algorithm for polynomials | cost of polynomial multiplication and division via predicate surface "complexityDependsOn" ⓘ |
| Clique problem | W[1]-complete ⓘ |
| Lenstra elliptic-curve factorization method | size of the smallest prime factor of n via predicate surface "complexityDependsOn" ⓘ |
| Zassenhaus algorithm for factoring polynomials over the rationals | degree of the polynomial via predicate surface "complexityDependsOn" ⓘ |
| Zassenhaus algorithm for factoring polynomials over the rationals | size of coefficients via predicate surface "complexityDependsOn" ⓘ |
| F4 algorithm | term ordering via predicate surface "complexityDependsOn" ⓘ |
| F4 algorithm | number of variables via predicate surface "complexityDependsOn" ⓘ |
| F4 algorithm | degrees of input polynomials via predicate surface "complexityDependsOn" ⓘ |
| F4 algorithm | sparsity of polynomials via predicate surface "complexityDependsOn" ⓘ |