The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable

DOI10.1006/jagm.1994.1015zbMath0795.11064OpenAlexW1996865269MaRDI QIDQ4285917

Ferell S. Wheeler, M. L. Robinson, Michael Filaseta

Publication date: 21 April 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4295c5cfce59b1eddb1d7319edde45d8673c3ab5

zbMATH Keywords

polynomialEuclidean normalgebraic numberseffective algorithmpractical algorithmpolynomials with integer coefficients

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09) Algebraic numbers; rings of algebraic integers (11R04)

Related Items (2)

On the reduced length of a polynomial with real coefficients ⋮ Polynomials with small Mahler measure

This page was built for publication: The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable