Faster combinatorial algorithms for determinant and Pfaffian
From MaRDI portal
Publication:848938
DOI10.1007/S00453-008-9240-9zbMATH Open1193.65049OpenAlexW1505415134MaRDI QIDQ848938FDOQ848938
Authors: 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
Recommendations
Cites Work
- Matching theory
- The complexity of computing the permanent
- The complexity of partial derivatives
- Advanced determinant calculus
- Matrix multiplication via arithmetic progressions
- A combinatorial approach to matrix algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Overlapping Pfaffians
- Title not available (Why is that?)
- Rectangular matrix multiplication revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combinatorial proof of the Cayley-Hamilton theorem
- Determinant: Old Algorithms, New Insights
- Title not available (Why is that?)
Cited In (11)
- The Faddeev-LeVerrier algorithm and the Pfaffian
- Fast parallel algorithms for vandermonde determinants
- Title not available (Why is that?)
- Faster geometric algorithms via dynamic determinant computation
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- A fast algorithm for index of annihilation computations
- A factorization algorithm to compute Pfaffians
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- Computation of principal \({\mathcal A}\)-determinants through dimer dynamics
- On the computation of pfaffians
This page was built for publication: Faster combinatorial algorithms for determinant and Pfaffian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848938)
