Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR26-326 | 16th November 2026 15:40

Möbius-Pseudorandomness for Algebraic Circuits

RSS-Feed




TR26-326
Authors: Gil Kalai, Mrinal Kumar, Ben Lee Volk
Publication: 21st November 2026 16:22
Downloads: 19
Keywords: 


Abstract:

We define a notion of Möbius-pseudorandomness for integer sequences generated by multivariate polynomials computed by small and simple algebraic circuits. This mirrors a related definition of Kalai that concerns boolean functions computed by small boolean circuits.

We then prove Möbius-pseudorandomness results for polynomials computed by algebraic circuits with few multiplication gates (of any depth), for polynomials with small-dimensional partial derivative space, and for the determinant and permanent.
We conjecture that these results hold in general for polynomial-size algebraic circuits.



ISSN 1433-8092 | Imprint