Polynomial algorithms for computing the permanents of some matrices

DOI10.1515/DMA.1997.7.4.413MaRDI QIDQ4522739zbMATH OpenOpenAlexFDO

Authors A. P. Ilyichev, G. P. Kogan, V. N. Shevchenko

Publication date 4 January 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1997.7.4.413

zbMATH Keywords

generating functionspermanentspolynomial algorithms

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Recommendations

• The asymptotic behaviour of permanents of some (0, 1)-matrices
• scientific article; zbMATH DE number 599410
• Computing the permanent of (some) complex matrices
• scientific article; zbMATH DE number 3930346
• The permanent of 0-1 matrices and Kallman's algorithm

Cited in

(11)

• Computing permanents of complex diagonally dominant matrices and tensors
• Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications
• scientific article; zbMATH DE number 20621 (Why is no real title available?)
• scientific article; zbMATH DE number 599410 (Why is no real title available?)
• The asymptotic behaviour of permanents of some (0, 1)-matrices
• On the Pólya conversion problem for permanents and determinants
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• scientific article; zbMATH DE number 6256206 (Why is no real title available?)
• Multi-linear formulas for permanent and determinant are of super-polynomial size
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• On the permanental polynomials of matrices

This page was built for publication: Polynomial algorithms for computing the permanents of some matrices

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