Akash Kumar Sengupta

Orcid: 0000-0002-0459-4411

According to our database1, Akash Kumar Sengupta authored at least 11 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Rank bounds and polynomial-time PIT for Σ<sup>k</sup>ΠΣΠ<sup>2</sup> circuits.
Electron. Colloquium Comput. Complex., 2026

2025
Rank Bounds and PIT for Σ<sup>3</sup> ΠΣΠ<sup>d</sup> circuits via a non-linear Edelstein-Kelly theorem.
CoRR, April, 2025

Rank Bounds and PIT for $\Sigma^3 \Pi \Sigma \Pi^d$ circuits via a non-linear Edelstein-Kelly theorem.
Electron. Colloquium Comput. Complex., 2025

Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theorem.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Uniform Bounds on Product Sylvester-Gallai Configurations.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
Strong Algebras and Radical Sylvester-Gallai Configurations.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Radical Sylvester-Gallai Theorem for Tuples of Quadratics.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Radical Sylvester-Gallai for Cubics.
Electron. Colloquium Comput. Complex., 2022

Radical Sylvester-Gallai Theorem for Cubics.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Robust Radical Sylvester-Gallai Theorem for Quadratics.
Proceedings of the 38th International Symposium on Computational Geometry, 2022


  Loading...