The complexity of the fermionant, and immanants of constant width

DOI10.4086/toc.2013.v009a006zbMath1366.68078arXiv1110.1821OpenAlexW1836282248MaRDI QIDQ3191574

Stephan Mertens, Moore, Cristopher

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.1821

zbMATH Keywords

computational complexitypartition functiongraph theoryrepresentation theorystatistical physicsdeterminantpermanentimmanantfermionant

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

On immanant functions related to Weyl groups of A n ⋮ Mixed determinants and the Kadison-Singer problem ⋮ Undirected determinant and its complexity ⋮ Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants ⋮ Unnamed Item

Cites Work

• New results for the Martin polynomial

This page was built for publication: The complexity of the fermionant, and immanants of constant width