Amit  Sinhababu
Amit Sinhababu
Assistant Professor, Chennai Mathematical Institute
No verified email
Cited by
Cited by
Discovering the roots: Uniform closure results for algebraic classes under factoring
P Dutta, N Saxena, A Sinhababu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits
A Pandey, N Saxena, A Sinhababu
computational complexity 27 (4), 617-670, 2018
Factorization of polynomials given by arithmetic branching programs
A Sinhababu, T Thierauf
computational complexity 30 (2), 1-47, 2021
Algebraic dependencies and PSPACE algorithms in approximative complexity
Z Guo, N Saxena, A Sinhababu
arXiv preprint arXiv:1801.09275, 2018
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field
Z Guo, N Saxena, A Sinhababu
Theory of Computing 15 (1), 1-30, 2019
Power series in complexity: Algebraic Dependence, Factor Conjecture and Hitting Set for Closure of VP
AK Sinhababu
PhD thesis, Indian Institute of Technology Kanpur, 2019
Arithmetic circuit complexity of division and truncation
P Dutta, G Jindal, A Pandey, A Sinhababu
36th Computational Complexity Conference (CCC 2021), 2021
Testing algebraic independence of polynomials over finite fields
AK Sinhababu
Indian Institute of Technology Kanpur, 2014
Algebraic independence over finite fields: Higher derivation based faster algorithm
A Pandey, N Saxena, A Sinhababu
The system can't perform the operation now. Try again later.
Articles 1–9