6 citations · 6 across the 1 of their papers we have counts for
5 papers
Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy
Sanyam Agarwal, Archit Hari, Anurag Pandey +1
Andrews, Garg, and Schost (FOCS~2026) recently, in a breakthrough result, placed Hilbert's Nullstellensatz (HN) in the Counting Hierarchy ($\CH$) using constant-depth circuits for…
Graph Homomorphism Polynomials: Algorithms and Complexity
Balagopal Komarath, Anurag Pandey, C. S. Rahul
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph to -vertex graphs. These polynomials have received a lot of at…
Algebraic Branching Programs, Border Complexity, and Tangent Spaces
Markus Bläser, Christian Ikenmeyer, Meena Mahajan +2
Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks…
How many zeros of a random sparse polynomial are real?
Gorav Jindal, Anurag Pandey, Himanshu Shukla +1
We investigate the number of real zeros of a univariate -sparse polynomial over the reals, when the coefficients of come from independent standard normal distributions.…
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov +2
We study the variety membership testing problem in the case when the variety is given as an orbit closure and the ambient space is the set of all 3-tensors. The first variety that…