• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 2024
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Homogeneous Algebraic Complexity Theory and Algebraic Formulas. ITCS 2024: 43:1-43:23
• 
  Peter Bürgisser, Gorav Jindal:
  On the Hardness of PosSLP. SODA 2024: 1872-1886
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Fixed-Parameter Debordering of Waring Rank. STACS 2024: 30:1-30:15
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Fixed-parameter debordering of Waring rank. CoRR abs/2401.07631 (2024)
• 
  Gorav Jindal, Joël Ouaknine:
  On the Counting Complexity of the Skolem Problem. CoRR abs/2403.00098 (2024)
• 
  Markus Bläser, Julian Dörfler, Gorav Jindal:
  PosSLP and Sum of Squares. CoRR abs/2403.00115 (2024)
• 2023
• 
  Gorav Jindal, Louis Gaillard:
  On the Order of Power Series and the Sum of Square Roots Problem. ISSAC 2023: 354-362
• 
  Louis Gaillard, Gorav Jindal:
  On the Order of Power Series and the Sum of Square Roots Problem. CoRR abs/2304.13605 (2023)
• 
  Peter Bürgisser, Gorav Jindal:
  On the Hardness of PosSLP. CoRR abs/2307.08008 (2023)
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Homogeneous Algebraic Complexity Theory and Algebraic Formulas. CoRR abs/2311.17019 (2023)
• 2022
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Border complexity via elementary symmetric polynomials. CoRR abs/2211.07055 (2022)
• 
  Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Border complexity via elementary symmetric polynomials. Electron. Colloquium Comput. Complex. TR22 (2022)
• 2021
• 
  Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
  Arithmetic Circuit Complexity of Division and Truncation. CCC 2021: 25:1-25:36
• 
  Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
  Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. TR21 (2021)
• 2020
• 
  Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
  How many zeros of a random sparse polynomial are real? ISSAC 2020: 273-280
• 2019
• 
  Gorav Jindal:
  On approximate polynomial identy testing and real root finding. Saarland University, Germany, 2019
• 
  Markus Bläser, Gorav Jindal:
  On the Complexity of Symmetric Polynomials. ITCS 2019: 47:1-47:14
• 
  Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey:
  A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. SODA 2019: 647-661
• 
  Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
  How many zeros of a random sparse polynomial are real? CoRR abs/1911.02540 (2019)
• 2018
• 
  Markus Bläser, Gorav Jindal, Anurag Pandey:
  A Deterministic PTAS for the Commutative Rank of Matrix Spaces. Theory Comput. 14(1): 1-21 (2018)
• 
  Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Generalized matrix completion and algebraic natural proofs. STOC 2018: 1193-1206
• 
  Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
  Generalized Matrix Completion and Algebraic Natural Proofs. Electron. Colloquium Comput. Complex. TR18 (2018)
• 2017
• 
  Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
  Density Independent Algorithms for Sparsifying k-Step Random Walks. APPROX-RANDOM 2017: 14:1-14:17
• 
  Markus Bläser, Gorav Jindal, Anurag Pandey:
  Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. CCC 2017: 33:1-33:16
• 
  Gorav Jindal, Michael Sagraloff:
  Efficiently Computing Real Roots of Sparse Polynomials. ISSAC 2017: 229-236
• 
  Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
  Density Independent Algorithms for Sparsifying k-Step Random Walks. CoRR abs/1702.06110 (2017)
• 
  Gorav Jindal, Michael Sagraloff:
  Efficiently Computing Real Roots of Sparse Polynomials. CoRR abs/1704.06979 (2017)
• 2016
• 
  Markus Bläser, Gorav Jindal, Anurag Pandey:
  Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Electron. Colloquium Comput. Complex. TR16 (2016)
• 2015
• 
  Gorav Jindal, Pavel Kolev:
  Faster Spectral Sparsification of Laplacian and SDDM Matrix Polynomials. CoRR abs/1507.07497 (2015)
• 2014
• 
  Markus Bläser, Gorav Jindal:
  A new deterministic algorithm for sparse multivariate polynomial interpolation. ISSAC 2014: 51-58

skipping 1 more match