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.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| complexityDependsOn | 9 |
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" ⓘ |