Anurag Pandey

According to our database, Anurag Pandey authored at least 15 papers between 2016 and 2026.

Collaborative distances:

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

2026

When Hilbert approximates: A Strong Nullstellensatz for Approximate Polynomial Satisfiability.

Sanyam Agarwal, Sagnik Dutta, Anurag Pandey, Himanshu Shukla

Electron. Colloquium Comput. Complex., 2026

2022

Rabbits Approximate, Cows Compute Exactly!

Balagopal Komarath, Anurag Pandey, Nitin Saurabh

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Variety membership testing in algebraic complexity theory.

Anurag Pandey

PhD thesis, 2021

On the Orbit Closure Containment Problem and Slice Rank of Tensors.

Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 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

Graph Homomorphism Polynomials: Algorithms and Complexity.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

CoRR, 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

Algebraic Branching Programs, Border Complexity, and Tangent Spaces.

Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh

Proceedings of the 35th Computational Complexity Conference, 2020

Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness.

Markus Bläser, Anurag Pandey

Proceedings of the Approximation, 2020

2019

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.

Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer

CoRR, 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

2018

A Deterministic PTAS for the Commutative Rank of Matrix Spaces.

Markus Bläser, Gorav Jindal, Anurag Pandey

Theory Comput., 2018

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

2016

Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits.

Anurag Pandey, Nitin Saxena, Amit Sinhababu

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016