Holant^*(f) denotes a class of counting problems specified
by a constrai...
We consider Shor's quantum factoring algorithm in the setting of noisy
q...
We prove a complexity dichotomy theorem for a class of Holant problems o...
We study the properties of elections that have a given position matrix (...
We prove a complexity dichotomy theorem for counting planar graph
homomo...
Recently, Mančinska and Roberson proved that two graphs G and G' are
qua...
We study the problem of counting all cycles or self-avoiding walks (SAWs...
We prove a complexity dichotomy for a class of counting problems express...
We prove a complexity dichotomy theorem for a class of Holant problems o...
Is Fully Polynomial-time Randomized Approximation Scheme (FPRAS) for a
p...
We prove #P-completeness results for counting edge colorings on simple
g...
We prove a complexity dichotomy for Holant problems on the boolean domai...
The complexity of graph homomorphisms has been a subject of intense stud...
Holant problems are intimately connected with quantum theory as tensor
n...
We consider the complexity of counting weighted graph homomorphisms defi...
Graph homomorphism has been an important research topic since its
introd...
We develop a theory of graph algebras over general fields. This is model...
We study the approximation complexity of the partition function of the
e...
Unique prime factorization of integers is taught in every high school. W...
We initiate a study of the classification of approximation complexity of...
In this paper we take the first step toward a classification of the
appr...