Algorithms for finite fields
BELABAS, Karim
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
BELABAS, Karim
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Idioma
en
Chapitre d'ouvrage
Este ítem está publicado en
Explicit methods in number theory. Rational points and Diophantine equations, Explicit methods in number theory. Rational points and Diophantine equations. 2012p. 1-18
SMF
Resumen en inglés
This series of lectures concentrates on deterministic algorithms for finite fields. The emphasis is not on developing algorithms for practical use, but on viewing the quest for polynomial-time algorithms as a challenge of ...Leer más >
This series of lectures concentrates on deterministic algorithms for finite fields. The emphasis is not on developing algorithms for practical use, but on viewing the quest for polynomial-time algorithms as a challenge of our structural understanding of finite fields. The topics treated include: representing finite fields, recognizing finite fields, constructing finite fields, constructing maps between finite fields and factoring polynomials.< Leer menos
Orígen
Importado de HalCentros de investigación