Follow
Anamay Tengse
Anamay Tengse
Reichman University
Verified email at campus.haifa.ac.il - Homepage
Title
Cited by
Cited by
Year
Near-optimal bootstrapping of hitting sets for algebraic circuits
M Kumar, R Saptharishi, A Tengse
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
282019
On the existence of algebraically natural proofs
P Chatterjee, M Kumar, C Ramya, R Saptharishi, A Tengse
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
102020
If VNP is hard, then so are equations for it
M Kumar, C Ramya, R Saptharishi, A Tengse
arXiv preprint arXiv:2012.07056, 2020
92020
Quasi-polynomial hitting sets for circuits with restricted parse trees
R Saptharishi, A Tengse
arXiv preprint arXiv:1709.03068, 2017
72017
Near-optimal Bootstrapping of Hitting Sets for Algebraic Models
M Kumar, R Saptharishi, A Tengse
arXiv preprint arXiv:1807.06323, 2018
22018
On Annihilators of Explicit Polynomial Maps
P Chatterjee, A Tengse
arXiv preprint arXiv:2309.07612, 2023
12023
On Finer Separations Between Subclasses of Read-Once Oblivious ABPs
C Ramya, A Tengse
arXiv preprint arXiv:2201.06432, 2022
12022
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
M Kumar, R Saptharishi, A Tengse
Theory of Computing 19 (1), 1-30, 2023
2023
Monotone classes beyond VNP
P Chatterjee, K Gajjar, A Tengse
arXiv preprint arXiv:2202.13103, 2022
2022
Transparency Beyond VNP in the Monotone Setting.
P Chatterjee, K Gajjar, A Tengse
Electron. Colloquium Comput. Complex., 2022
2022
Hitting Sets for Algebraic Models Constructions and Consequences
AG Tengse
Mumbai, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–11