|
Fundamentalnaya i Prikladnaya Matematika, 2019, Volume 22, Issue 4, Pages 253–262
(Mi fpm1828)
|
|
|
|
Randomness and complexity in matrix groups
V. Shpilrain Department of Mathematics, The City College of New York, New York, NY 10031
Abstract:
We reflect on how to define the complexity of a matrix and how to
sample a random invertible matrix. We also discuss a related issue
of complexity of algorithms in matrix groups.
Citation:
V. Shpilrain, “Randomness and complexity in matrix groups”, Fundam. Prikl. Mat., 22:4 (2019), 253–262; J. Math. Sci., 257:6 (2021), 919–925
Linking options:
https://www.mathnet.ru/eng/fpm1828 https://www.mathnet.ru/eng/fpm/v22/i4/p253
|
|