The complexity of computing all subfields of an algebraic number field (Q1733310): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PARI/GP / rank | |||
Normal rank | |||
Revision as of 19:51, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing all subfields of an algebraic number field |
scientific article |
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
