A note on the number of ways to compute a determinant using cofactor expansion

MaRDI QIDQ2918399zbMATH OpenFDO

Authors Robert A. Beeler

Publication date 6 October 2012

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

asymptoticsboundscofactor expansiondeterminantrecurrence

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Recommendations

• Determinant: Old Algorithms, New Insights
• A simple division-free algorithm for computing determinants
• Some determinant expansions and the matrix-tree theorem
• On cofactor expansion of determinants of Boolean matrices
• scientific article; zbMATH DE number 3018328

Cited in

(1)

• On cofactor expansion of determinants of Boolean matrices

This page was built for publication: A note on the number of ways to compute a determinant using cofactor expansion

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