Anurag Pandey

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 20

Top Topics

Algebraic Curves

Complexity Theory

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Publications

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica 85 (9) (2023)
Balagopal Komarath, Anurag Pandey, Nitin Saurabh
Rabbits Approximate, Cows Compute Exactly! MFCS (2022)
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ICALP (2022)
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
Arithmetic Circuit Complexity of Division and Truncation. Computational Complexity Conference (2021)
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
On the Orbit Closure Containment Problem and Slice Rank of Tensors. SODA (2021)
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. 28 (2021)
Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos
How many zeros of a random sparse polynomial are real? ISSAC (2020)
Markus Bläser, Anurag Pandey
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. APPROX-RANDOM (2020)
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CoRR (2020)
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electron. Colloquium Comput. Complex. 27 (2020)
Balagopal Komarath, Anurag Pandey, C. S. Rahul
Graph Homomorphism Polynomials: Algorithms and Complexity. CoRR (2020)
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Computational Complexity Conference (2020)
Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos
How many zeros of a random sparse polynomial are real? CoRR (2019)
Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. SODA (2019)
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. CoRR (2019)
Anurag Pandey, Nitin Saxena, Amit Sinhababu
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. 27 (4) (2018)
Markus Bläser, Gorav Jindal, Anurag Pandey
A Deterministic PTAS for the Commutative Rank of Matrix Spaces. Theory Comput. 14 (1) (2018)
Markus Bläser, Gorav Jindal, Anurag Pandey
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Computational Complexity Conference (2017)
Anurag Pandey, Nitin Saxena, Amit Sinhababu
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. MFCS (2016)
Markus Bläser, Gorav Jindal, Anurag Pandey
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Electron. Colloquium Comput. Complex. 23 (2016)