Pages that link to "Item:Q2031651"
From MaRDI portal
The following pages link to Analysis of generalized continued fraction algorithms over polynomials (Q2031651):
Displaying 4 items.
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010) (← links)
- Analysis of performance of symmetric second-order line search algorithms through continued fractions (Q2729613) (← links)
- An analysis of polynomial sequences and their application to discrete fractional operators (Q5163951) (← links)