Anamay Tengse

Electron. Colloquium Comput. Complex., 2025

2024

The Complexity of Order-Finding for ROABPs.

[BibT_eX]

[DOI]

CoRR, 2024

Explicit Commutative ROABPs from Partial Derivatives.

[BibT_eX]

[DOI]

Vishwas Bhargava

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models.

[BibT_eX]

[DOI]

Theory Comput., 2023

On Annihilators of Explicit Polynomial Maps.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Monotone Classes Beyond VNP.

[BibT_eX]

[DOI]

Kshitij Gajjar

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Transparency Beyond VNP in the Monotone Setting.

[BibT_eX]

[DOI]

Kshitij Gajjar

Electron. Colloquium Comput. Complex., 2022

On Finer Separations Between Subclasses of Read-Once Oblivious ABPs.

[BibT_eX]

[DOI]

C. Ramya

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

If VNP Is Hard, Then so Are Equations for It.

[BibT_eX]

[DOI]

C. Ramya

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2020

On the Existence of Algebraically Natural Proofs.

[BibT_eX]

[DOI]

C. Ramya

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees.

[BibT_eX]

[DOI]