Discovering the roots: Uniform closure results for algebraic classes under factoring. - Pranjal Dutta; Nitin Saxena 001; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2017)

Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. - Anurag Pandey 001; Nitin Saxena 001; Amit Sinhababu (Comput. Complex., 2018)

Algebraic dependencies and PSPACE algorithms in approximative complexity. - Zeyu Guo 001; Nitin Saxena 001; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2018)

Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. - Zeyu Guo 001; Nitin Saxena 001; Amit Sinhababu (Theory Comput., 2019)

Factorization of Polynomials Given by Arithmetic Branching Programs. - Amit Sinhababu; Thomas Thierauf (Comput. Complex., 2021)

Arithmetic Circuit Complexity of Division and Truncation. - Pranjal Dutta; Gorav Jindal; Anurag Pandey 001; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2021)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. - Pranjal Dutta; Amit Sinhababu; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2024)

IPS Lower Bounds for Formulas and Sum of1 ROABPs. - Prerona Chatterjee; Utsab Ghosal; Partha Mukhopadhyay; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2025)

IPS Lower Bounds for Formulas and Sum of ROABPs. - Prerona Chatterjee; Utsab Ghosal; Partha Mukhopadhyay; Amit Sinhababu (CoRR, 2025)