Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aam.2013.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974936994 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 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
