An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) |
scientific article |
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
