On the complexity of inverting integer and polynomial matrices (Q901933)
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 complexity of inverting integer and polynomial matrices |
scientific article; zbMATH DE number 6526937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of inverting integer and polynomial matrices |
scientific article; zbMATH DE number 6526937 |
Statements
On the complexity of inverting integer and polynomial matrices (English)
0 references
6 January 2016
0 references
integer matrix
0 references
polynomial matrix
0 references
matrix inverse
0 references
Smith normal form
0 references
bit complexity
0 references
randomized algorithm
0 references
0.8620363473892212
0 references
0.8530899882316589
0 references
0.8177669048309326
0 references
0.7974109053611755
0 references
