Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Nikita Kondratyonok"'
Autor:
Nikita Kondratyonok, Maksim Vaskouski
Publikováno v:
Journal of Symbolic Computation. 104:134-141
The present paper is devoted to methods of the automatic verifying of the Kronecker-Vahlen theorem on the shortest length of the Euclidean algorithm in algebraic number fields with the infinite group of units. We provide explicit methods to prove tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39577b29d67f77478778218c772bf56e
https://doi.org/10.1016/j.jsc.2020.04.009
https://doi.org/10.1016/j.jsc.2020.04.009
Autor:
Maksim Vaskouski, Nikita Kondratyonok
Publikováno v:
Journal of Symbolic Computation. 77:175-188
We investigate the problem on the validity of the Lazard theorem analogue (or the Kronecker-Vahlen theorem), which states that the least remainder Euclidean Algorithm (EA) has the shortest length over any other versions of EA, in unique factorization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f11f91e400e8db967447ea31ab3b9087
https://doi.org/10.1016/j.jsc.2016.02.003
https://doi.org/10.1016/j.jsc.2016.02.003