Postdoctoral Researcher

Gorav Jindal

University of Regensburg · Regensburg, Germany

I am a postdoctoral researcher in the Algorithms and Complexity Theory group at the University of Regensburg, working with Radu Curticapean.

My research is in algebraic complexity theory and computational complexity, with a recent focus on formal power series and the theoretical foundations of linear dynamical systems. I am interested in arithmetic circuits, polynomial identity testing, and rationality questions for power series.

Selected publications

All publications →

2027

SODA
When Are Monomial Symmetric Polynomials Hard?

Markus Bläser, Radu Curticapean, Sagnik Dutta, Gorav Jindal

Proceedings of the 2027 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2027 · Accepted for publication

PDF arXiv
2026

SODA
Problems from Optimization and Computational Algebra Equivalent to Hilbert’s Nullstellensatz

Markus Bläser, Sagnik Dutta, Gorav Jindal

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026

PDF DOI arXiv Slides
2020

ISSAC
How Many Zeros of a Random Sparse Polynomial Are Real?

Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 2020

PDF DOI Slides
2019

ITCS
On the Complexity of Symmetric Polynomials

Markus Bläser, Gorav Jindal

10th Innovations in Theoretical Computer Science Conference (ITCS), 2019

PDF DOI Slides
2018

TOC
A Deterministic PTAS for the Commutative Rank of Matrix Spaces

Markus Bläser, Gorav Jindal, Anurag Pandey

Theory of Computing, 2018

PDF DOI Video

Gorav Jindal

Selected publications

When Are Monomial Symmetric Polynomials Hard?

Problems from Optimization and Computational Algebra Equivalent to Hilbert’s Nullstellensatz

How Many Zeros of a Random Sparse Polynomial Are Real?

On the Complexity of Symmetric Polynomials

A Deterministic PTAS for the Commutative Rank of Matrix Spaces