Geodesic
Randomness and complexity in matrix groups
Fundamentalʹnaâ i prikladnaâ matematika, Tome 22 (2019) no. 4, pp. 253-262

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{FPM_2019_22_4_a16,
     author = {V. Shpilrain},
     title = {Randomness and complexity in matrix groups},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {253--262},
     publisher = {mathdoc},
     volume = {22},
     number = {4},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2019_22_4_a16/}
}
TY  - JOUR
AU  - V. Shpilrain
TI  - Randomness and complexity in matrix groups
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2019
SP  - 253
EP  - 262
VL  - 22
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2019_22_4_a16/
LA  - ru
ID  - FPM_2019_22_4_a16
ER  - 
%0 Journal Article
%A V. Shpilrain
%T Randomness and complexity in matrix groups
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2019
%P 253-262
%V 22
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2019_22_4_a16/
%G ru
%F FPM_2019_22_4_a16
V. Shpilrain. Randomness and complexity in matrix groups. Fundamentalʹnaâ i prikladnaâ matematika, Tome 22 (2019) no. 4, pp. 253-262. http://geodesic.mathdoc.fr/item/FPM_2019_22_4_a16/