A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397)
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: A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 |
scientific article; zbMATH DE number 1910551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 |
scientific article; zbMATH DE number 1910551 |
Statements
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (English)
0 references
14 May 2003
0 references
irreducible polynomials
0 references
irreducible trinomials
0 references
primitive polynomials
0 references
primitive trinomials
0 references
Mersenne exponents
0 references
Mersenne numbers
0 references
random number generators
0 references
0.8693773746490479
0 references
0.8403055667877197
0 references
0.8309254050254822
0 references
0.8236444592475891
0 references
