Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:29, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fine costs for Euclid's algorithm on polynomials and Farey maps |
scientific article |
Statements
Fine costs for Euclid's algorithm on polynomials and Farey maps (English)
0 references
25 March 2014
0 references
Laurent formal power series
0 references
finite field
0 references
continued fractions
0 references
Farey map
0 references
bit-complexity
0 references
cost function
0 references
combinatorial analysis
0 references
bivariate generating functions
0 references
