scientific article; zbMATH DE number 1775055
From MaRDI portal
Publication:4542181
Recommendations
Cited in
(21)- The combinatorial approach yields an NC algorithm for computing Pfaffians
- A simple division-free algorithm for computing determinants
- Parameterized complexity of determinant and permanent
- Tracy-Widom distributions for the Gaussian orthogonal and symplectic ensembles revisited: a skew-orthogonal polynomials approach
- Exact, efficient, and complete arrangement computation for cubic curves
- Faster geometric algorithms via dynamic determinant computation
- New division free algorithm for finding the determinant
- Rural postman parameterized by the number of components of required edges
- scientific article; zbMATH DE number 4037907 (Why is no real title available?)
- Tensor network complexity of multilinear maps
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- On the exact evaluation of spin networks
- Subtraction-free complexity, cluster transformations, and spanning trees
- Matchgate shadows for fermionic quantum simulation
- Undirected determinant and its complexity
- A new formula for the determinant and bounds on its tensor and Waring ranks
- A simple division-free algorithm for computing Pfaffians
- Near-optimal fault tolerance for efficient batch matrix multiplication via an additive combinatorics lens
- Graph coloring below guarantees via co-triangle packing
- The Faddeev-LeVerrier algorithm and the Pfaffian
- Faster combinatorial algorithms for determinant and Pfaffian
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542181)
