Vendredi 20 septembre 2013 à 10h30 en salle B549

Luca De Feo (UVSQ)

Titre : Algorithms for F_p-bar

Résumé :

Realizing in software the algebraic closure of a finite field F_p is equivalent to construct
so called "compatible lattices of finite fields", i.e. a collection of finite extensions of F_p together
with embeddings F_p^m ⊂ F_p^n whenever m | n.
There are known algorithms to construct compatible lattices in deterministic polynomial time,
but the status of the most **practically** efficient algorithms is still unclear. This talk will review
the classical tools available, then present some new ideas towards the efficient construction
of compatible lattices, possibly in quasi-optimal time.