Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SET-MULTILINEAR ARITHMETIC CIRCUITS:
Reports tagged with Set-multilinear arithmetic circuits:
TR26-314 | 9th November 2026
Amir Shpilka

Polynomial-size hitting sets for multilinear any-order read-once algebraic branching programs and for set-multilinear depth-$3$ circuits with constant-size variable sets

In this paper we give polynomial-size hitting sets for multilinear any-order read-once oblivious algebraic branching programs and for depth-$3$ set-multilinear circuits where each variable set has constant size. Our results also extend to the border of both classes and hold over fields of any characteristic.

The proof combines the ... more >>>




ISSN 1433-8092 | Imprint