Pages that link to "Item:Q1908009"

The following pages link to The Euclidean algorithm in algebraic number fields (Q1908009):

Displaying 45 items.

• Inhomogeneous minima of mixed signature lattices (Q290019) (← links)
• Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor (Q378841) (← links)
• Bounds for the Euclidean minima of function fields (Q397887) (← links)
• On Euclid's algorithm and elementary number theory (Q627201) (← links)
• A generalization of the LLL-algorithm over Euclidean rings or orders (Q679101) (← links)
• Norm-Euclidean Galois fields and the generalized Riemann hypothesis (Q713181) (← links)
• On the Euclidean minimum of some real number fields (Q819852) (← links)
• A Euclidean algorithm for normal bases (Q850785) (← links)
• Upper bounds for Euclidean minima of algebraic number fields (Q863293) (← links)
• NTRU over rings beyond \(\mathbb{Z}\) (Q977194) (← links)
• A computer algorithm for finding new Euclidean number fields (Q1273177) (← links)
• Euclidean systems (Q1277186) (← links)
• New number-theoretic cryptographic primitives (Q2023304) (← links)
• The eleventh power residue symbol (Q2027273) (← links)
• The twisted Euclidean algorithm: applications to number theory and geometry (Q2216570) (← links)
• Numerical stability of Euclidean algorithm over ultrametric fields (Q2397945) (← links)
• Growth results and Euclidean ideals (Q2445008) (← links)
• Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
• Remarks on Euclidean minima (Q2637451) (← links)
• Euclidean algorithm in Galois quartic fields (Q2687373) (← links)
• (Q2968050) (← links)
• The Euclidean algorithm in quintic and septic cyclic fields (Q2981792) (← links)
• Some generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean (Q3094294) (← links)
• On the S-Euclidean minimum of an ideal class (Q3195151) (← links)
• (Q3257189) (← links)
• Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
• Euclidean minima of totally real number fields: Algorithmic determination (Q3433769) (← links)
• (Q3464055) (← links)
• (Q3645716) (← links)
• The Euclidean Algorithm in Cubic Number Fields (Q3837788) (← links)
• On a Waring’s problem for integral quadratic and Hermitian forms (Q4633597) (← links)
• Non-Galois cubic fields which are Euclidean but not norm-Euclidean (Q4718415) (← links)
• Continued fractionsin $2$-stage Euclidean quadratic fields (Q4912024) (← links)
• A note on Euclidean cyclic cubic fields (Q4972513) (← links)
• (Q4972514) (← links)
• Badly approximable numbers over imaginary quadratic fields (Q5226465) (← links)
• Computation of the Euclidean minimum of algebraic number fields (Q5401707) (← links)
• On Radix Representation and the Euclidean Algorithm (Q5556558) (← links)
• Transfinitely valued Euclidean domains have arbitrary indecomposable order type (Q5743058) (← links)
• On the norm-Euclideanity of \(\mathbb Q\left(\sqrt{2+\sqrt{2+\sqrt 2}}\right)\) and \(\mathbb Q\left(\sqrt{2+\sqrt 2}\right)\) (Q5939699) (← links)
• Upper bounds for the Euclidean minima of abelian fields (Q5963340) (← links)
• Euclidean algorithm for a class of linear orders (Q6056733) (← links)
• Statistics of genus numbers of cubic fields (Q6114285) (← links)
• On the finiteness of $\mathfrak{P}$-adic continued fractions for number fields (Q6172426) (← links)
• On the greatest common divisor in imaginary quadratic fields (Q6670617) (← links)