Are there elimination algorithms for the permanent?

DOI10.1080/03081089308818189zbMath0766.15007OpenAlexW2008442718MaRDI QIDQ4033465

Carl Sturtivant

Publication date: 16 May 1993

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089308818189

zbMATH Keywords

algorithmsGaussian eliminationmultivariate polynomialspermanentelimination algorithmlinear symmetries

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• A note on the determinant and permanent problem
• Algebraic Geometry. I: Complex projective varieties.
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Decision Problems in Group Theory
• Some Exact Complexity Results for Straight-Line Computations over Semirings

This page was built for publication: Are there elimination algorithms for the permanent?