Faster Combinatorial Algorithms for Determinant and Pfaffian
From MaRDI portal
Recommendations
Cites work
- Advanced determinant calculus
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- scientific article; zbMATH DE number 1151367 (Why is no real title available?)
- scientific article; zbMATH DE number 1405680 (Why is no real title available?)
- scientific article; zbMATH DE number 6472651 (Why is no real title available?)
- Matching theory
- Matrix multiplication via arithmetic progressions
- Overlapping Pfaffians
- Rectangular matrix multiplication revisited
- The complexity of computing the permanent
- The complexity of partial derivatives
Cited in
(7)- On the computation of pfaffians
- A fast algorithm for index of annihilation computations
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- scientific article; zbMATH DE number 1775055 (Why is no real title available?)
- Fast parallel algorithms for vandermonde determinants
- Faster combinatorial algorithms for determinant and Pfaffian
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 Q5387794)