Gorav Jindal

According to our database, Gorav Jindal authored at least 21 papers between 2012 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2026

Geometric complexity theory for product-plus-power.

Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

J. Symb. Comput., 2026

2025

Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz.

Markus Bläser, Sagnik Dutta, Gorav Jindal

CoRR, October, 2025

2024

Fixed-Parameter Debordering of Waring Rank.

Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On the Hardness of PosSLP.

Peter Bürgisser, Gorav Jindal

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Homogeneous Algebraic Complexity Theory and Algebraic Formulas.

Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

PosSLP and Sum of Squares.

Markus Bläser, Julian Dörfler, Gorav Jindal

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

On the Order of Power Series and the Sum of Square Roots Problem.

Gorav Jindal, Louis Gaillard

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

Border complexity via elementary symmetric polynomials.

Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

Electron. Colloquium Comput. Complex., 2022

2021

Arithmetic Circuit Complexity of Division and Truncation.

Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu

Proceedings of the 36th Computational Complexity Conference, 2021

2020

How many zeros of a random sparse polynomial are real?

Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

On approximate polynomial identy testing and real root finding.

Gorav Jindal

PhD thesis, 2019

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.

Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Complexity of Symmetric Polynomials.

Markus Bläser, Gorav Jindal

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

A Deterministic PTAS for the Commutative Rank of Matrix Spaces.

Markus Bläser, Gorav Jindal, Anurag Pandey

Theory Comput., 2018

Generalized matrix completion and algebraic natural proofs.

Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Efficiently Computing Real Roots of Sparse Polynomials.

Gorav Jindal, Michael Sagraloff

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces.

Markus Bläser, Gorav Jindal, Anurag Pandey

Proceedings of the 32nd Computational Complexity Conference, 2017

Density Independent Algorithms for Sparsifying k-Step Random Walks.

Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani

Proceedings of the Approximation, 2017

2015

Faster Spectral Sparsification of Laplacian and SDDM Matrix Polynomials.

Gorav Jindal, Pavel Kolev

CoRR, 2015

2014

A new deterministic algorithm for sparse multivariate polynomial interpolation.

Markus Bläser, Gorav Jindal

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2012

Subtraction makes computing integers faster

Thatchaphol Saranurak, Gorav Jindal

CoRR, 2012