Are There Elimination Algorithms for the Permanent?
DOI:
https://doi.org/10.7146/dpb.v19i306.6699Resumé
We define the class of elimination algorithms. These are algebraic algorithms for evaluating multivariate polynomials, and include as a special case, Gaussian elimination for evaluating the determinant. We show how to find the linear symmetries of a polynomial, defined appropriately, and use these methods to find the linear symmetries of the permanent and determinant. We show that in contrast to Gaussian elimination for the determinant, there is no elimination algorithm for the permanent.Downloads
Publiceret
1990-03-01
Citation/Eksport
Sturtivant, C. (1990). Are There Elimination Algorithms for the Permanent?. DAIMI Report Series, 19(306). https://doi.org/10.7146/dpb.v19i306.6699
Nummer
Sektion
Articles
Licens
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.