Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > AKASH SENGUPTA:
All reports by Author Akash Sengupta:

TR26-084 | 20th May 2026
Abhibhav Garg, Rafael Mendes de Oliveira, Akash Sengupta, Nir Shalmon, Amir Shpilka

Rank bounds and polynomial-time PIT for $\Sigma^k \Pi \Sigma \Pi^2$ circuits

A depth-4 algebraic circuit with top fan-in $k$ and bottom fan-in $2$ is a circuit $\Phi$ of the form $\Phi = \sum_{i=1}^k \prod_{j=1}^{m_i} Q_{ij}$, where the polynomials $Q_{ij} \in \mathbb{K}[x_1, \ldots, x_n]$ have degree at most $2$.
The class of all such circuits is denoted by $\Sigma^k \Pi \Sigma ... more >>>


TR25-136 | 26th September 2025
Sumegha Garg, Akash Sengupta

Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes

We study the robust local testability of tensor products of two Algebraic-Geometry (AG) codes. In particular, we prove that \textit{constant rate} AG codes are robust locally testable. This significantly generalizes the seminal result of Polishchuk-Spielman [PS24], which proved robust local testability of Reed-Solomon codes. We establish an algebraic-geometric framework ... more >>>




ISSN 1433-8092 | Imprint