On the complexity of computing determinants
type: Item
instance of: scholarly article
title: On the complexity of computing determinants
zbMATH Open document ID: 1061.68185
author: Gilles Villard
author: Erich L. Kaltofen
published in: Computational Complexity
publication date: 2005-03-01T00:00:00Z
full work available at URL: http://www.lib.ncsu.edu/resolver/1840.2/87
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F40
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 15B36
zbMATH DE Number: 2140063
zbMATH Keywords: Integer matrix
zbMATH Keywords: matrix determinant
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: Smith normal form
zbMATH Keywords: bit complexity
zbMATH Keywords: division-free complexity
zbMATH Keywords: randomized algorithm
zbMATH Keywords: multivariable control theory
zbMATH Keywords: realization
zbMATH Keywords: matrix sequence
zbMATH Keywords: block Wiedemann algorithm
zbMATH Keywords: block Lanczos algorithm
MaRDI profile type: Publication
OpenAlex ID: W2161330625
Wikidata QID: Q56459440
DBLP publication ID: journals/cc/KaltofenV05
DOI: 10.1007/S00037-004-0185-3
description: scientific article; zbMATH DE number 2140063