Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315)
From MaRDI portal
scientific article; zbMATH DE number 7671054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field |
scientific article; zbMATH DE number 7671054 |
Statements
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (English)
0 references
31 March 2023
0 references
finite fields
0 references
rational points
0 references
Euclidean algorithm
0 references
symmetric functions
0 references
resultant
0 references
average-case complexity
0 references
0 references
