The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings.
Matrix-forest theorems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Explicit formulas via Chebyshev polynomials for rooted spanning forests in circulant graphs C_n(s1..sk) and C_2n, with f_G(n)=p a(n)^2 and asymptotic via Mahler measure of associated Laurent polynomial.
citing papers explorer
-
On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings.
-
The number of rooted forests in circulant graphs
Explicit formulas via Chebyshev polynomials for rooted spanning forests in circulant graphs C_n(s1..sk) and C_2n, with f_G(n)=p a(n)^2 and asymptotic via Mahler measure of associated Laurent polynomial.