On the complexity of computing determinants
DOI10.1007/s00037-004-0185-3zbMath1061.68185WikidataQ56459440 ScholiaQ56459440MaRDI QIDQ1766817
Erich L. Kaltofen, Gilles Villard
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 polynomial; randomized algorithm; block Lanczos algorithm; realization; Smith normal form; bit complexity; division-free complexity; matrix determinant; matrix sequence; Integer matrix; block Wiedemann algorithm; multivariable control theory
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
15A15: Determinants, permanents, traces, other special matrix functions
65F40: Numerical computation of determinants
65Y20: Complexity and performance of numerical algorithms
68W20: Randomized algorithms
15B36: Matrices of integers
Related Items