On the computational complexity of Bongartz's algorithm (Q5300618)
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: On the computational complexity of Bongartz's algorithm |
scientific article; zbMATH DE number 6182066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of Bongartz's algorithm |
scientific article; zbMATH DE number 6182066 |
Statements
On the Computational Complexity of Bongartz's Algorithm (English)
0 references
27 June 2013
0 references
algorithm
0 references
computational complexity
0 references
computer algebra
0 references
GAP
0 references
module
0 references
common direct summand
0 references
Gaussian elimination
0 references
decomposition
0 references
isomorphism problem
0 references
0.75676029920578
0 references
0.7501966953277588
0 references
0.7412682771682739
0 references
0.7399248480796814
0 references
