Determinant: Old Algorithms, New Insights
From MaRDI portal
Recommendations
- Determinant: Old algorithms, new insights
- scientific article; zbMATH DE number 1332669
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- scientific article; zbMATH DE number 2235064
Cited in
(20)- The complexity of the characteristic and the minimal polynomial.
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Functional programming concepts and straight-line programs in computer algebra
- Counting the number of perfect matchings, and generalized decision trees
- Factorization of polynomials given by arithmetic branching programs
- Noncommutativity makes determinants hard
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent
- Berkowitz's algorithm and clow sequences
- A note on the number of ways to compute a determinant using cofactor expansion
- Calculation of the determinant with a claw or double claws structure
- Coefficients of the Characteristic Polynomial
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- Reachability and distances under multiple changes
- Determinant: Old algorithms, new insights
- Factorization of polynomials given by arithmetic branching programs
- On the exact evaluation of spin networks
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\)
- A largish sum-of-squares implies circuit hardness and derandomization
- Faster combinatorial algorithms for determinant and Pfaffian
- The quantum query complexity of the determinant
This page was built for publication: Determinant: Old Algorithms, New Insights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699172)
