Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290)
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: Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes |
scientific article; zbMATH DE number 7074717
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes |
scientific article; zbMATH DE number 7074717 |
Statements
Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (English)
0 references
28 June 2019
0 references
polynomial factoring
0 references
permutation group
0 references
finite field
0 references
algebraic combinatorics
0 references
deterministic polynomial-time factoring algorithm
0 references
primitive Galois groups of superpolynomial order
0 references
0 references
0 references
0.94398355
0 references
0.94247746
0 references
0.93189895
0 references
0.92673063
0 references
0.9266642
0 references
0.9188628
0 references
0.9174993
0 references
