Abhibhav Garg

Orcid: 0000-0001-9084-7499

According to our database1, Abhibhav Garg authored at least 12 papers between 2020 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

An Improved Construction of Variety-Evasive Subspace Families.
Electron. Colloquium Comput. Complex., 2026

Hilbert's Nullstellensatz is in the Counting Hierarchy.
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

An exposition of recent list-size bounds of FRS Codes.
Electron. Colloquium Comput. Complex., 2025

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 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

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

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

2020
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020


  Loading...