The complexity of computing all subfields of an algebraic number field (Q1733310)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of computing all subfields of an algebraic number field |
scientific article; zbMATH DE number 7040040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing all subfields of an algebraic number field |
scientific article; zbMATH DE number 7040040 |
Statements
The complexity of computing all subfields of an algebraic number field (English)
0 references
21 March 2019
0 references
subfields
0 references
lattice
0 references
partitions
0 references
0 references
0.91385853
0 references
0.90820247
0 references
0.9068106
0 references
0.90676934
0 references
0 references
