Old Web
English
Sign In
Acemap
>
Paper
>
The extended Euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic c
The extended Euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic c
1999
Andreas Enge
Keywords:
Combinatorics
Greatest common divisor
Discrete mathematics
Finite field
Mathematics
Euclidean algorithm
Polynomial
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]