On the deterministic complexity of factoring polynomials over finite fields (Q911294): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the deterministic complexity of factoring polynomials over finite fields |
scientific article |
Statements
On the deterministic complexity of factoring polynomials over finite fields (English)
0 references
1990
0 references
factorization
0 references
irreducible polynomials
0 references
