Effective computations of module inverses with the Approximating k-ary GDD Algorithm by Ishmukhametov algorithm.
Ishmukhametov developed a new algorithm for calculating the greatest common divisor of natural
On a problem of Ishmukhametov of their Lachlan sets.
Ishmukhametov provided a systematic investigation of such degrees, and proved that for a
On a problem of Ishmukhametov of their Lachlan sets.
Ishmukhametov provided a systematic investigation of such degrees, and proved that for a
Comparing different GCD algorithms by S.
Ishmukhametov. We outline main advantage sides and shortages of each considered algorithm