On the complexity of matrix reduction over finite fields (Q2467342)
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 matrix reduction over finite fields |
scientific article; zbMATH DE number 5228803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of matrix reduction over finite fields |
scientific article; zbMATH DE number 5228803 |
Statements
On the complexity of matrix reduction over finite fields (English)
0 references
21 January 2008
0 references
The authors study the complexity of matrix elimination over finite fields in terms of row operations.They present an algorithm called ``striped matrix elimination'' which is asymptotically faster than traditional Gauss-Jordan elimination. They present results of a large computational study of complexities for small matrices and fields.Finally they give a conjecture on the behaviour of a natural analogue of GLn for semifields and prove this for a certain class of semifields
0 references
semifields
0 references
algorithm
0 references
Gauss-Jordan elimination
0 references
