Pages that link to "Item:Q2439896"

The following pages link to Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896):

Displaying 3 items.

• Farey maps, Diophantine approximation and Bruhat-Tits tree (Q405952) (← links)
• Analysis of generalized continued fraction algorithms over polynomials (Q2031651) (← links)
• Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315) (← links)