Anamay Tengse

Orcid: 0000-0002-7305-8110

According to our database1, Anamay Tengse authored at least 13 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Lower Bounds from Succinct Hitting Sets.
Electron. Colloquium Comput. Complex., 2025

2024
The Complexity of Order-Finding for ROABPs.
CoRR, 2024

Explicit Commutative ROABPs from Partial Derivatives.
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.
Theory Comput., 2023

On Annihilators of Explicit Polynomial Maps.
Electron. Colloquium Comput. Complex., 2023

Monotone Classes Beyond VNP.
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.
Electron. Colloquium Comput. Complex., 2022

On Finer Separations Between Subclasses of Read-Once Oblivious ABPs.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

If VNP Is Hard, Then so Are Equations for It.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2020
On the Existence of Algebraically Natural Proofs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees.
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.
Electron. Colloquium Comput. Complex., 2017


  Loading...