Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244)
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: Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation |
scientific article; zbMATH DE number 6517833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation |
scientific article; zbMATH DE number 6517833 |
Statements
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (English)
0 references
8 December 2015
0 references
matrix
0 references
minimal polynomial
0 references
finite field
0 references
block blackbox algorithm
0 references
probability
0 references
0 references
0.8319902420043945
0 references
0.8031226396560669
0 references
