Fast arithmetic for the algebraic closure of finite fields

DOI10.1145/2608628.2608672zbMath1325.68272OpenAlexW2061807792MaRDI QIDQ3452386

Luca De Feo, Javad Doliskani, Éric Schost

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608672

zbMATH Keywords

extensionsfinite fieldsirreducible polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic field extensions (12F05)

Related Items

Computing isomorphisms and embeddings of finite fields ⋮ Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields

Uses Software

• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: Fast arithmetic for the algebraic closure of finite fields