Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > THÉO FABRIS:
All reports by Author Théo Fabris:

TR25-219 | 22nd December 2025
Bruno Pasqualotto Cavalar, Théo Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff

Negations are powerful even in small depth

We study the power of negation in the Boolean and algebraic settings and show the following results.

* We construct a family of polynomials $P_n$ in $n$ variables, all of whose monomials have positive coefficients, such that $P_n$ can be computed by a depth three circuit of polynomial size ... more >>>




ISSN 1433-8092 | Imprint