Faster combinatorial algorithms for determinant and Pfaffian

DOI10.1007/s00453-008-9240-9zbMath1193.65049OpenAlexW1505415134MaRDI QIDQ848938

Anna Urbańska

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9240-9

zbMATH Keywords

combinatoricsalgorithmgraphdeterminantPfaffianmatrix

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Related Items (1)

Faster geometric algorithms via dynamic determinant computation

Cites Work

• The complexity of computing the permanent
• A combinatorial proof of the Cayley-Hamilton theorem
• Matrix multiplication via arithmetic progressions
• A combinatorial approach to matrix algebra
• Matching theory
• The complexity of partial derivatives
• Advanced determinant calculus
• Rectangular matrix multiplication revisited
• Overlapping Pfaffians
• Determinant: Old Algorithms, New Insights
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster combinatorial algorithms for determinant and Pfaffian