Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6273685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine costs for Euclid's algorithm on polynomials and Farey maps |
scientific article; zbMATH DE number 6273685 |
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
0 references
0 references
0 references
0 references
0.8792014
0 references
0.86922413
0 references
0.8616122
0 references
0.8579873
0 references
0.85776305
0 references
0.8530895
0 references
0.8502454
0 references
