On computing the determinant and Smith form of an integer matrix

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 675-685

  Eberly, Wayne ^a   Giesbrecht, Mark ^b   Villard, Gilles ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; MONTE CARLO METHODS; PROBABILITY; THEOREM PROVING;

INTEGER MATRIX; SMITH FORM;

MATRIX ALGEBRA;

EID: 0034511243     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892335     Document Type: Article

References (0)