An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank (Q1650656)
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: An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank |
scientific article |
Statements
An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank (English)
0 references
5 July 2018
0 references
deterministic polynomial-time test
0 references
Dedekind domains
0 references
basis representation
0 references
Hermite and Smith normal forms
0 references
0.8210583329200745
0 references
0.7890806794166565
0 references
0.7776779532432556
0 references
