Anurag Pandey

22 papers A* 3A 3B 3Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
When Hilbert approximates: A Strong Nullstellensatz for Approximate Polynomial Satisfiability.
Electron. Colloquium Comput. Complex.
Sanyam Agarwal, Sagnik Dutta, Anurag Pandey, Himanshu Shukla
2023 J jnl
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
Algorithmica
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2022 A* conf
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
ICALP
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2022 B conf
Rabbits Approximate, Cows Compute Exactly!
MFCS
Balagopal Komarath, Anurag Pandey, Nitin Saurabh
2021 A conf
Arithmetic Circuit Complexity of Division and Truncation.
CCC
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
2021 J jnl
Arithmetic Circuit Complexity of Division and Truncation.
Electron. Colloquium Comput. Complex.
Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu
2021 A* conf
On the Orbit Closure Containment Problem and Slice Rank of Tensors.
SODA
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
2021 — —
Variety membership testing in algebraic complexity theory.
Anurag Pandey
2020 A conf
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
CCC
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 J jnl
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
CoRR
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 J jnl
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Electron. Colloquium Comput. Complex.
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 J jnl
Graph Homomorphism Polynomials: Algorithms and Complexity.
CoRR
Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul
2020 B conf
How many zeros of a random sparse polynomial are real?
ISSAC
Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos
2020 — conf
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness.
APPROX-RANDOM
Markus Bläser, Anurag Pandey
2019 A* conf
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.
SODA
Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey
2019 J jnl
How many zeros of a random sparse polynomial are real?
CoRR
Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos
2019 J jnl
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.
CoRR
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
2018 J jnl
A Deterministic PTAS for the Commutative Rank of Matrix Spaces.
Theory Comput.
Markus Bläser, Gorav Jindal, Anurag Pandey
2018 J jnl
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits.
Comput. Complex.
Anurag Pandey, Nitin Saxena, Amit Sinhababu
2017 A conf
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces.
CCC
Markus Bläser, Gorav Jindal, Anurag Pandey
2016 B conf
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits.
MFCS
Anurag Pandey, Nitin Saxena, Amit Sinhababu
2016 J jnl
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces.
Electron. Colloquium Comput. Complex.
Markus Bläser, Gorav Jindal, Anurag Pandey