On the deterministic complexity of factoring polynomials over finite fields (Q911294): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020306558 / rank | |||
Normal rank | |||
Revision as of 19:39, 19 March 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
