On the complexity of computing determinants
From MaRDI portal
randomized algorithmcharacteristic polynomialrealizationblock Lanczos algorithmSmith normal formbit complexitydivision-free complexitymatrix determinantmatrix sequenceInteger matrixblock Wiedemann algorithmmultivariable control theory
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Numerical computation of determinants (65F40)
Recommendations
- scientific article; zbMATH DE number 1263378
- scientific article; zbMATH DE number 1332669
- On computing the determinant in small parallel time using a small number of processors
- scientific article; zbMATH DE number 2187725
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
Cited in
(52)- scientific article; zbMATH DE number 7070491 (Why is no real title available?)
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- A fast algorithm to construct a representation for transversal matroids
- Multilinear polynomial systems: root isolation and bit complexity
- scientific article; zbMATH DE number 2086387 (Why is no real title available?)
- Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH
- Graph characterization by counting sink star subgraphs
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- High-order lifting for polynomial Sylvester matrices
- Faster geometric algorithms via dynamic determinant computation
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- On the complexity of inverting integer and polynomial matrices
- scientific article; zbMATH DE number 2187725 (Why is no real title available?)
- On the complexity of computing Kronecker coefficients
- Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
- On computing the determinant in small parallel time using a small number of processors
- Undirected determinant and its complexity
- More extensions of a determinant inequality of Hartfiel
- Critical groups of graphs with dihedral actions. II.
- Efficient sampling in spectrahedra and volume approximation
- Computational Science and Its Applications – ICCSA 2004
- Interpolation in Valiant's theory
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- On the Expressive Power of Read-Once Determinants
- On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- An introspective algorithm for the integer determinant
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- The shifted number system for fast linear algebra on integer matrices
- Zariski chambers on surfaces of high Picard number
- Relaxed Hensel lifting of triangular sets
- Finding the growth rate of a regular or context-free language in polynomial time
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Computing the determinant of a dense matrix over \(\mathbb{Z}\)
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Sparse resultants and straight-line programs
- An oracle-based, output-sensitive algorithm for projections of resultant polytopes
- Essentially optimal computation of the inverse of generic polynomial matrices
- Computing the Degree of Determinants via Combinatorial Relaxation
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- Efficient computation of the characteristic polynomial of a threshold graph
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
- Computing characteristic polynomials of p-curvatures in average polynomial time
- On FGLM algorithms with Tate algebras
- A fraction free matrix Berlekamp/Massey algorithm
- On the complexity of Chow and Hurwitz forms
- Efficient Disjointness Tests for Private Datasets
- Asymptotically fast polynomial matrix algorithms for multivariable systems
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
This page was built for publication: On the complexity of computing determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766817)
