Anurag Pandey

According to our database1, Anurag Pandey authored at least 11 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Rabbits Approximate, Cows Compute Exactly!
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Variety membership testing in algebraic complexity theory.
PhD thesis, 2021

On the Orbit Closure Containment Problem and Slice Rank of Tensors.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Arithmetic Circuit Complexity of Division and Truncation.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
How many zeros of a random sparse polynomial are real?
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Proceedings of the 35th Computational Complexity Conference, 2020

Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness.
Proceedings of the Approximation, 2020

2019
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2017
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces.
Proceedings of the 32nd Computational Complexity Conference, 2017

2016
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016


  Loading...