Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > WARING RANK:
Reports tagged with waring rank:
TR22-157 | 16th November 2022
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

Border complexity via elementary symmetric polynomials

Revisions: 1

In (ToCT’20) Kumar surprisingly proved that every polynomial can be approximated as a sum of a constant and a product of linear polynomials. In this work, we prove the converse of Kumar's result which ramifies in a surprising new formulation of Waring rank and border Waring rank. From this conclusion, ... more >>>


TR25-007 | 5th February 2025
Amir Shpilka

Improved Debordering of Waring Rank

We prove that if a degree-$d$ homogeneous polynomial $f$ has border Waring rank $\underline{\mathrm{WR}}({f}) = r$, then its Waring rank is bounded by
\[
{\mathrm{WR}}({f}) \leq d \cdot r^{O(\sqrt{r})}.
\]
This result significantly improves upon the recent bound ${\mathrm{WR}}({f}) \leq d \cdot 4^r$ established in [Dutta, Gesmundo, Ikenmeyer, Jindal, ... more >>>


TR26-217 | 28th September 2026
Shubham Bhardwaj, Ramprasad Saptharishi

Hitting Sets for Polynomials with Small Partial Derivative Spaces

Revisions: 1

We give an explicit hitting set of size $\text{poly}(n,d,r)$ for the class of $n$-variate degree-$d$ polynomials whose partial derivative space is bounded by $r$, over any field $\mathbb{F}$ of characteristic zero. In particular, this yields a polynomial sized hitting set for the class of depth-$3$ powering circuits.

The main ... more >>>




ISSN 1433-8092 | Imprint