Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5203517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields |
scientific article; zbMATH DE number 5203517 |
Statements
Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (English)
0 references
23 October 2007
0 references
Deterministic algorithms
0 references
finite fields
0 references
polynomial factorization
0 references
Berlekamp algorithm
0 references
Niederreiter algorithm
0 references
0 references
0.9396262
0 references
0.9362078
0 references
0.9244353
0 references
0.92302597
0 references
0.92115813
0 references
