Amit Sinhababu

Testing Algebraic Independence Of Polynomials Over Finite Fields

Amit Sinhababu, 2022 .

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring

Nitin Saxena, P. Dutta, Amit Sinhababu, 2022, J. ACM.

Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits

Nitin Saxena, Amit Sinhababu, A. Pandey, 2018, computational complexity.

Algebraic dependencies and PSPACE algorithms in approximative complexity pdf

Nitin Saxena, Zeyu Guo, Amit Sinhababu, 2018, Electron. Colloquium Comput. Complex..

Discovering the roots: uniform closure results for algebraic classes under factoring

Nitin Saxena, Amit Sinhababu, Pranjal Dutta, 2017, Electron. Colloquium Comput. Complex..

Arithmetic circuit complexity of division and truncation

Gorav Jindal, Anurag Pandey, Amit Sinhababu, 2021, Electron. Colloquium Comput. Complex..

Factorization of Polynomials Given by Arithmetic Branching Programs

Thomas Thierauf, Amit Sinhababu, T. Thierauf, 2020, computational complexity.