Computing with algebraically closed fields

DOI10.1016/j.jsc.2009.09.005zbMath1180.12005MaRDI 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 factorization; algebraic closure; field extension; algebraic number field; root finding; algebraic function field; inseparability; non-perfect field

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

12F05: Algebraic field extensions

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

12-04: Software, source code, etc. for problems pertaining to field theory

Related Items

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

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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