GJ
Gorav Jindal
cs.CCcs.DMcs.DScs.SCmath.AGcs.LOcs.NAmath.CAmath.COmath.NA
On Valency
published · living versionsW_p5tfrsme·v1 · currentpublished
Deterministic Shift Equivalence Testing for Sparse Polynomials
with Markus Bläser, Pranjal Dutta, Sagnik Dutta
1 version
W_cn6fa5jx·v1published
W_qssv67fs·v1published
Preprints & journals
16 papers in the corpus · 2012–2026Deterministic Shift Equivalence Testing for Sparse Polynomials2610.27168v1 · Markus Blaser, Pranjal Dutta, Sagnik Dutta et al.2026 · 0 citationsarXivon Valency
When Are Monomial Symmetric Polynomials Hard?2610.25181v1 · Markus Blaser, Radu Curticapean, Sagnik Dutta et al.2026 · 0 citationsarXivon Valency
Deterministic NC Quadratic Root Counting in Characteristic Two2609.12669v1 · Sanyam Agarwal, Gorav Jindal2026 · 0 citationsarXivon Valency
Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz2510.19704v2 · Markus Blaser, Sagnik Dutta, Gorav Jindal2025 · 0 citationsarXiv
On the Counting Complexity of the Skolem Problem2403.00098v2 · Gorav Jindal, Joel Ouaknine2024 · 0 citationsarXiv
PosSLP and Sum of Squares2403.00115v1 · Markus Blaser, Julian Dorfler, Gorav Jindal2024 · 0 citationsarXiv
Fixed-parameter debordering of Waring rank2401.07631v1 · Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer et al.2024 · 1 citation41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), pp. 30:1-30:15
Homogeneous Algebraic Complexity Theory and Algebraic Formulas2311.17019v1 · Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer et al.2023 · 2 citations15th Innovations in Theoretical Computer Science Conference (ITCS 2024), pp. 43:1-43:23
On the Hardness of PosSLP2307.08008v1 · Peter Burgisser, Gorav Jindal2023 · 0 citationsarXiv
On the Order of Power Series and the Sum of Square Roots Problem2304.13605v1 · Louis Gaillard, Gorav Jindal2023 · 0 citationsarXiv
Geometric complexity theory for product-plus-power2211.07055v3 · Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer et al.2022 · 1 citationarXiv
How many zeros of a random sparse polynomial are real?1911.02540v1 · Gorav Jindal, Anurag Pandey, Himanshu Shukla et al.2019 · 4 citationsarXiv
Efficiently Computing Real Roots of Sparse Polynomials1704.06979v1 · Gorav Jindal, Michael Sagraloff2017 · 6 citationsarXiv
Density Independent Algorithms for Sparsifying -Step Random Walks1702.06110v1 · Gorav Jindal, Pavel Kolev, Richard Peng et al.2017 · 7 citationsarXiv
An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials1507.07497v4 · Gorav Jindal, Pavel Kolev2015 · 3 citationsarXiv
Subtraction makes computing integers faster1212.2549v1 · Thatchaphol Saranurak, Gorav Jindal2012 · 2 citationsarXiv
Career total: 31 works. 16 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.