Pages that link to "Item:Q1273177"
From MaRDI portal
The following pages link to A computer algorithm for finding new Euclidean number fields (Q1273177):
Displaying 7 items.
- A sufficient condition of Euclidean rings given by polynomial optimization over a box (Q478924) (← links)
- Euclidean fields having a large Lenstra constant (Q798364) (← links)
- On the Euclidean minimum of some real number fields (Q819852) (← links)
- Exceptional units and Euclidean number fields (Q884655) (← links)
- Euclidean minima of totally real number fields: Algorithmic determination (Q3433769) (← links)
- Euclid's Algorithm in Cubic Fields with Complex Conjugates (Q4133715) (← links)
- The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable (Q4285917) (← links)