Faster Combinatorial Algorithms for Determinant and Pfaffian

DOI10.1007/978-3-540-77120-3_52zbMath1193.15008OpenAlexW2762508959MaRDI QIDQ5387794

Anna Urbańska

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_52

zbMATH Keywords

MatrixAlgorithmPfaffianGraphDeterminant

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Determinants, permanents, traces, other special matrix functions (15A15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• The complexity of computing the permanent
• Matrix multiplication via arithmetic progressions
• Matching theory
• The complexity of partial derivatives
• Advanced determinant calculus
• Rectangular matrix multiplication revisited
• Overlapping Pfaffians
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster Combinatorial Algorithms for Determinant and Pfaffian