2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CC2024
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
Pranjal Dutta, Amit Sinhababu, Thomas Thierauf
For a polynomial from a class of polynomials, we show that the problem to compute all the constant degree irreducible factors of reduces in polynomial time to…
cs.CC2018★ 2 cited
Algebraic dependencies and PSPACE algorithms in approximative complexity
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Testing whether a set of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebra…
cs.CC2017
Discovering the roots: Uniform closure results for algebraic classes under factoring
Pranjal Dutta, Nitin Saxena, Amit Sinhababu
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsN…