Mostrar el registro sencillo del ítem

Algorithms for finite fields

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorBELABAS, Karim
dc.date.accessioned2024-04-04T02:20:11Z
dc.date.available2024-04-04T02:20:11Z
dc.date.issued2012
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/189469
dc.description.abstractEnThis 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.
dc.language.isoen
dc.publisherSMF
dc.source.titleExplicit methods in number theory. Rational points and Diophantine equations
dc.title.enAlgorithms for finite fields
dc.typeChapitre d'ouvrage
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
bordeaux.page1-18
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.title.proceedingExplicit methods in number theory. Rational points and Diophantine equations
hal.identifierhal-00932379
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00932379v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Explicit%20methods%20in%20number%20theory.%20Rational%20points%20and%20Diophantine%20equations&rft.date=2012&rft.spage=1-18&rft.epage=1-18&rft.au=BELABAS,%20Karim&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem