Publications

2024

  1. arXiv
    Fixed-parameter debordering of Waring rank (To appear in STACS 2024)
    2024
  2. ITCS
    Homogeneous Algebraic Complexity Theory and Algebraic Formulas
    In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024

2023

  1. arXiv
    On the Hardness of PosSLP (To appear in SODA 2024)
    Peter Bürgisser, and Gorav Jindal
    2023
  2. ISSAC
    On the Order of Power Series and the Sum of Square Roots Problem
    Louis Gaillard, and Gorav Jindal
    In Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

  1. arXiv
    De-bordering and Geometric Complexity Theory for Waring rank and related models
    2022

2021

  1. CCC
    Arithmetic Circuit Complexity of Division and Truncation
    Pranjal DuttaGorav JindalAnurag Pandey, and Amit Sinhababu
    In 36th Computational Complexity Conference (CCC 2021), 2021

2020

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

2019

  1. SODA
    A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
    In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
  2. ITCS
    On the Complexity of Symmetric Polynomials
    Markus Bläser, and Gorav Jindal
    In 10th Innovations in Theoretical Computer Science Conference (ITCS), 2019
  3. PhDThesis
    On Approximate Polynomial Identity Testing and Real Root Finding
    Gorav Jindal
    Saarland University, 2019

2018

  1. TOC
    A Deterministic PTAS for the Commutative Rank of Matrix Spaces
    Markus BläserGorav Jindal, and Anurag Pandey
    In Theory of Computing, 2018
  2. STOC
    Generalized Matrix Completion and Algebraic Natural Proofs
    In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

  1. CCC
    Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces
    Markus BläserGorav Jindal, and Anurag Pandey
    In 32nd Computational Complexity Conference (CCC 2017), 2017
  2. APPROX/RANDOM
    Density Independent Algorithms for Sparsifying k-Step Random Walks
    Gorav JindalPavel KolevRichard Peng, and Saurabh Sawlani
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), 2017
  3. ISSAC
    Efficiently Computing Real Roots of Sparse Polynomials
    Gorav Jindal, and Michael Sagraloff
    In Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2014

  1. ISSAC
    A New Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation
    Markus Bläser, and Gorav Jindal
    In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, 2014

2013

  1. MasterThesis
    Randomness Efficient Testing of Sparse Black Box Polynomials and Related Tests
    Gorav Jindal
    Saarland University, 2013

2012

  1. arXiv
    Subtraction makes computing integers faster
    Gorav Jindal, and Thatchaphol Saranurak
    2012

2008

  1. BachelorThesis
    Managing Secured Documents Over Long Periods
    Gorav Jindal
    Department of Computer Science and Engineering, IIT Delhi, 2008