Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. - Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2017)

Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. - Ramprasad Saptharishi; Anamay Tengse (FSTTCS, 2018)

Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. - Mrinal Kumar 001; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2018)

On the Existence of Algebraically Natural Proofs. - Prerona Chatterjee; Mrinal Kumar 001; C. Ramya; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2020)

If VNP is hard, then so are equations for it. - Mrinal Kumar 001; C. Ramya; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2020)

Transparency Beyond VNP in the Monotone Setting. - Prerona Chatterjee; Kshitij Gajjar; Anamay Tengse (Electron. Colloquium Comput. Complex., 2022)

On Finer Separations between Subclasses of Read-once Oblivious ABPs. - C. Ramya; Anamay Tengse (Electron. Colloquium Comput. Complex., 2022)

On Annihilators of Explicit Polynomial Maps. - Prerona Chatterjee; Anamay Tengse (Electron. Colloquium Comput. Complex., 2023)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. - Mrinal Kumar 001; Ramprasad Saptharishi; Anamay Tengse (Theory Comput., 2023)

The Complexity of Order-Finding for ROABPs. - Vishwas Bhargava; Pranjal Dutta; Sumanta Ghosh; Anamay Tengse (CoRR, 2024)

Explicit Commutative ROABPs from Partial Derivatives. - Vishwas Bhargava; Anamay Tengse (Electron. Colloquium Comput. Complex., 2024)

Monotone classes beyond VNP. - Prerona Chatterjee; Kshitij Gajjar; Anamay Tengse (Theor. Comput. Sci., 2024)

Lower Bounds from Succinct Hitting Sets. - Prerona Chatterjee; Anamay Tengse (Electron. Colloquium Comput. Complex., 2025)