On the complexity of computing determinants
Publication:1766817
DOI10.1007/S00037-004-0185-3zbMath1061.68185DBLPjournals/cc/KaltofenV05OpenAlexW2161330625WikidataQ56459440 ScholiaQ56459440MaRDI QIDQ1766817
Gilles Villard, Erich L. Kaltofen
Publication date: 1 March 2005
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.2/87
characteristic polynomialrandomized algorithmblock Lanczos algorithmrealizationSmith normal formbit complexitydivision-free complexitymatrix determinantmatrix sequenceInteger matrixblock Wiedemann algorithmmultivariable control theory
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20) Matrices of integers (15B36)
Related Items (34)
This page was built for publication: On the complexity of computing determinants