Computing with algebraically closed fields

DOI10.1016/j.jsc.2009.09.005zbMath1180.12005OpenAlexW2095430016MaRDI QIDQ846355

Allan K. Steel

Publication date: 9 February 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2009.09.005

zbMATH Keywords

polynomial factorizationalgebraic closurefield extensionalgebraic number fieldroot findingalgebraic function fieldinseparabilitynon-perfect field

Mathematics Subject Classification ID

Related Items (2)

Dynamic Galois theory ⋮ Quantum Periods for Certain Four-Dimensional Fano Manifolds

Uses Software

• Magma

Cites Work

• Factoring polynomials and the knapsack problem
• Solving zero-dimensional algebraic systems
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Magma algebra system. I: The user language
• Lattices of compatibly embedded finite fields
• On the theories of triangular sets
• Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
• Implementation of prime decomposition of polynomial ideals over small finite fields
• Factoring Polynomials Over Algebraic Number Fields
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing with algebraically closed fields