On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix |
| |
Authors: | V Y Pan |
| |
Institution: | (1) Department of Mathematics and Computer Science, Lehman College of CUNY, USA |
| |
Abstract: | We reexamine the Wiedemann—Coppersmith—Kaltofen—Villard algorithm for randomized computation of the determinant of an integer
matrix and substantially simplify and accelerate its bottleneck stage of computing the minimum generating matrix polynomial,
to make the algorithm practically promising while keeping it asymptotically fast. Bibliography: 58 titles.
Published in Zapiski Nauchnykh Seminarov POMI, Vol. 316, 2004, pp. 163–187. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|