|
Zapiski Nauchnykh Seminarov POMI, 2004, Volume 316, Pages 163–187
(Mi znsl731)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix
V. Ya. Pan Lehman College of The City University of New York, Mathematics and Computer Science Department
Abstract:
We reexamine the Wiedemann–Coppersmith–Kaltofen–Villard algorithm for randomized computation of the determinant of integer matrices 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.
Received: 27.11.2004
Citation:
V. Ya. Pan, “On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix”, Computational complexity theory. Part IX, Zap. Nauchn. Sem. POMI, 316, POMI, St. Petersburg, 2004, 163–187; J. Math. Sci. (N. Y.), 134:5 (2006), 2411–2424
Linking options:
https://www.mathnet.ru/eng/znsl731 https://www.mathnet.ru/eng/znsl/v316/p163
|
Statistics & downloads: |
Abstract page: | 198 | Full-text PDF : | 88 | References: | 50 |
|