Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ANAKIN DEY:
All reports by Author Anakin Dey:

TR26-297 | 3rd November 2026
Anakin Dey, Pranjal Dutta, Zeyu Guo

An Exponential Top Fan-In Hierarchy for Border Depth-4 Circuits

We study depth-$4$ algebraic circuits with bounded top and bottom fan-in over fields of characteristic $0$. These circuits compute sums of at most $k$ products of polynomials of degree at most $\delta$. We denote this class of circuits by $\Sigma^{[k]}\Pi\Sigma\Pi^{[\delta]}$. Our hard polynomial for this class is $P_{k + 1,n}$, ... more >>>


TR25-189 | 20th November 2025
Anakin Dey, Zeyu Guo

Debordering Closure Results in Determinantal and Pfaffian Ideals

Revisions: 1

One important question in algebraic complexity is understanding the complexity of polynomial ideals (Grochow, Bulletin of EATCS 131, 2020). Andrews and Forbes (STOC 2022) studied the determinantal ideals $I^{\det}_{n,m,r}$ generated by the $r\times r$ minors of $n\times m$ matrices. Over fields of characteristic zero or of sufficiently large characteristic, they ... more >>>




ISSN 1433-8092 | Imprint