A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693)
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: A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z [x] |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) |
scientific article |
Statements
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (English)
0 references
14 February 2019
0 references
generalized Hermite normal form
0 references
Gröbner basis
0 references
polynomial-time algorithm
0 references
\(\mathbb{Z} [x]\) module
0 references
0 references
0 references
0.9061477184295654
0 references
0.8429049849510193
0 references
