Anamay Tengse

According to our database, Anamay Tengse authored at least 12 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Monotone classes beyond VNP.

Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse

Theor. Comput. Sci., 2024

Explicit Commutative ROABPs from Partial Derivatives.

Vishwas Bhargava, Anamay Tengse

Electron. Colloquium Comput. Complex., 2024

The Complexity of Order-Finding for ROABPs.

Vishwas Bhargava, Pranjal Dutta, Sumanta Ghosh, Anamay Tengse

CoRR, 2024

2023

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models.

Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse

Theory Comput., 2023

On Annihilators of Explicit Polynomial Maps.

Prerona Chatterjee, Anamay Tengse

Electron. Colloquium Comput. Complex., 2023

2022

On Finer Separations between Subclasses of Read-once Oblivious ABPs.

C. Ramya, Anamay Tengse

Electron. Colloquium Comput. Complex., 2022

Transparency Beyond VNP in the Monotone Setting.

Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse

Electron. Colloquium Comput. Complex., 2022

2020

If VNP is hard, then so are equations for it.

Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse

Electron. Colloquium Comput. Complex., 2020

On the Existence of Algebraically Natural Proofs.

Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse

Electron. Colloquium Comput. Complex., 2020

2018

Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.

Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse

Electron. Colloquium Comput. Complex., 2018

Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees.

Ramprasad Saptharishi, Anamay Tengse

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.

Ramprasad Saptharishi, Anamay Tengse

Electron. Colloquium Comput. Complex., 2017