Anurag Pandey

Affiliations:
  • Max Planck Institute for Informatics, Saarbrücken, Germany


According to our database1, Anurag Pandey authored at least 14 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
Algorithmica, September, 2023

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

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

Arithmetic Circuit Complexity of Division and Truncation.
Electron. Colloquium Comput. Complex., 2021

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

2020
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Electron. Colloquium Comput. Complex., 2020

Graph Homomorphism Polynomials: Algorithms and Complexity.
CoRR, 2020

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

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

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

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

2018
A Deterministic PTAS for the Commutative Rank of Matrix Spaces.
Theory Comput., 2018

Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits.
Comput. Complex., 2018

2016
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces.
Electron. Colloquium Comput. Complex., 2016


  Loading...