Are there elimination algorithms for the permanent?

DOI10.1080/03081089308818189zbMATH Open0766.15007OpenAlexW2008442718MaRDI QIDQ4033465FDOQ4033465

Authors: C. 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

Recommendations

• Computing the permanent of (some) complex matrices
• scientific article; zbMATH DE number 3930346
• scientific article; zbMATH DE number 5057518
• The permanent of 0-1 matrices and Kallman's algorithm
• The permanent of a square matrix

zbMATH Keywords

algorithmsGaussian eliminationpermanentmultivariate polynomialselimination algorithmlinear symmetries

Mathematics Subject Classification ID

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

Cites Work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033465)