Pages that link to "Item:Q2548173"
From MaRDI portal
The following pages link to Fast computation of continued fraction expansions. (Q2548173):
Displaying 4 items.
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices (Q6652394) (← links)