An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(80)90011-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061874356 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic Algorithms in Finite Fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4164569 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Factoring Polynomials Over Large Finite Fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 13 June 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
