2 papers
cs.CC2025
Improved Debordering of Waring Rank
Amir Shpilka
We prove that if a degree- homogeneous polynomial has border Waring rank , then its Waring rank is bounded by \[ {\mathrm{WR}}({f}) \leq d…
cs.CC2024
On the Complexity of Hazard-Free Formulas
Leah London Arazi, Amir Shpilka
This paper studies the hazard-free formula complexity of Boolean functions. Our first result shows that unate functions are the only Boolean functions for which the monotone formul…