
Graph Homomorphism Polynomials: Algorithms and Complexity
We study homomorphism polynomials, which are polynomials that enumerate ...
read it

Algebraic Branching Programs, Border Complexity, and Tangent Spaces
Nisan showed in 1991 that the width of a smallest noncommutative single...
read it

How many zeros of a random sparse polynomial are real?
We investigate the number of real zeros of a univariate ksparse polynom...
read it

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
We study the variety membership testing problem in the case when the var...
read it
Anurag Pandey
is this you? claim profile