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.
Computational complexity: a modern approach
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The work develops properties of ultrafilters, prefilters, and related notions on connectivity systems while surveying a range of graph width, length, and depth parameters.
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.
-
Various Properties of Various Ultrafilters, Various Graph Width Parameters, and Various Connectivity Systems (with Survey)
The work develops properties of ultrafilters, prefilters, and related notions on connectivity systems while surveying a range of graph width, length, and depth parameters.