… showed that the Tutte polynomial is #Phard to … cover polynomial: We prove that, in almost
the whole plane, the problem of evaluating the cover polynomial is #Phard under polynomial-…

… Jaeger, Vertigan, and Welsh showed that the Tutte polynomial is #Phard to … cover polynomials:
We prove that, in almost the whole plane, the problem of evaluating the cover polynomial …

… for polynomials (of degree d), splines (of order s2l with m equally spaced knots and d = m
+ s - l), or trigonometric series (with a maximal frequency of d /2). We focus on the polynomial …

… the complexity of evaluating the cover polynomial for planar graphs. We show that the cover
polynomial is … For the geometric cover polynomial, we obtain the same dichotomy as in [3] for …

… coe cients of the characteristic polynomial can be expressed as cycle covers in the graph G
(… x) equals the sum of the disjoint weighted cycles that cover N −i nodes in G, with appropriate …

… complexity … -polynomial in k) sample complexity and runtime. More importantly, by taking
d to be a large universal constant, we obtain an algorithm with polynomial sample complexity …

… of D’Antona and Munarini [4], the computational complexity of evaluating C(D;x, y) at … by
defining a new cover polynomial Ct(D;x, y) which generalizes our earlier polynomial in several …

… polynomial time algorithms that check if there exists a locally injective or a locally surjective
homomorphism, respectively, from a universal cover TG to a universal cover TH … complexity of …

… of the Tutte polynomial is known. In this paper we introduce the cover polynomial C(D; x, y)
for a directed graph D and examine its relationships to other graph polynomials. While the …

… polynomial identity testing (PIT) problem (decide nonzeroness of the computed polynomial)
and the polynomial … if a given polynomial divides another given polynomial) which captures …