Name
Abstract | ||
|---|---|---|
A sum of affine powers is an expression of the formf (x(1),..., x(n)) = Sigma(i=1) (s) a(i)l(i) (x(1),..., x(n))(ei)where l(i) is an affine form. We propose polynomial time black- box algorithms that find the decomposition with the smallest value of s for an input polynomial f. Our algorithms work in situations where s is small enough compared to the number of variables or to the exponents ei. Although quite simple, this model is a generalization of Waring decomposition. This paper extends previous work on Waring decomposition as well as our work on univariate sums of affine powers (ISSAC' 17). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3208976.3208993 | ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION |
Field | DocType | Citations |
Affine transformation,Discrete mathematics,Combinatorics,Of the form,Polynomial,Computer science,Equivalence (measure theory),Time complexity,Univariate | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ignacio García-Marco | 1 | 6 | 2.66 |
| Pascal Koiran | 2 | 919 | 113.85 |
| Timothée Pecatte | 3 | 16 | 2.89 |