8 citations · 9 across the 5 of their papers we have counts for
6 papers
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…
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
Pranjal Dutta, Prateek Dwivedi, Nitin Saxena
Polynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth- reduction result by Agrawal and Vinay (FOCS 2008) has made PIT for depth- circuits…
Geometric complexity theory for product-plus-power
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer +2
According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of li…
Efficient reductions and algorithms for variants of Subset Sum
Pranjal Dutta, Mahesh Sreekumar Rajasree
Given , the Subset Sum problem () is to decide whether there exists such that $\sum_{i \in S}…
A note on faithful coupling of Markov chains
Debojyoti Dey, Pranjal Dutta, Somenath Biswas
One often needs to turn a coupling of a Markov chain into a sticky coupling where once at some , then from then on, at each subsequent time st…
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…