A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Add wikidata reference. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148367244 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1204.1298 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130992883 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 16 December 2024
scientific article; zbMATH DE number 6420343
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for computing the HNF of a module over the integers of a number field |
scientific article; zbMATH DE number 6420343 |
Statements
A polynomial time algorithm for computing the HNF of a module over the integers of a number field (English)
0 references
27 March 2015
0 references
complexity
0 references
Hermite normal form
0 references
modules
0 references
number theory
0 references
