The complexity of computing all subfields of an algebraic number field
type: Item
instance of: scholarly article
title: The complexity of computing all subfields of an algebraic number field
zbMATH Open document ID: 1419.11143
author: Jonas Szutkoski
author: Mark van Hoeij
published in: Journal of Symbolic Computation
publication date: 2019-03-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1606.01140
Mathematics Subject Classification ID: 11Y40
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7040040
zbMATH Keywords: subfields
zbMATH Keywords: lattice
zbMATH Keywords: partitions
describes a project that uses: Magma
describes a project that uses: PARI/GP
MaRDI profile type: Publication
OpenAlex ID: W2962962711
arXiv ID: 1606.01140
cites work: Q4714011
cites work: A relative van Hoeij algorithm over number fields
cites work: Q4314299
cites work: The Magma algebra system. I: The user language
cites work: Meet and join within the lattice of set partitions
cites work: Symmetric Functions, m-Sets, and Galois Groups
cites work: A polynomial reduction algorithm
cites work: Sharp estimates for triangular sets
cites work: Q3348991
cites work: Computing congruences efficiently
cites work: Block Systems of a Galois Group
cites work: On computing subfields. A detailed description of the algorithm
cites work: Q3135187
cites work: Powers of tensors and fast matrix multiplication
cites work: Factoring polynomials with rational coefficients
cites work: Q3748279
cites work: Q3963106
cites work: Q4660692
cites work: Gradual sub-lattice reduction and a new complexity for factoring polynomials
cites work: Isomorphisms of algebraic number fields
cites work: Generating subfields
cites work: Modern computer algebra
Wikidata QID: Q129655446
DOI: 10.1016/J.JSC.2018.06.001
Recommended article: Q3348991
Recommended article: Q3470563
Recommended article: Algorithmic Number Theory
Recommended article: Complexity of computation in finite fields
Recommended article: Q3197949
Recommended article: Polynomial computability of fields of algebraic numbers
Recommended article: Fields of algebraic numbers computable in polynomial time. II
Recommended article: Computing subfields of number fields and applications to Galois group computations
Recommended article: Fields of algebraic numbers computable in polynomial time. I
Recommended article: Q3748196
description: scientific article