An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027)
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: An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) |
scientific article; zbMATH DE number 3714914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) |
scientific article; zbMATH DE number 3714914 |
Statements
An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (English)
0 references
1980
0 references
computer algebra
0 references
polynomial factorization
0 references
average computing time
0 references
