Recognizing Units in Number Fields

DOI10.2307/2153582zbMath0811.11080OpenAlexW1977949908MaRDI QIDQ4305960

Guoqiang Ge

Publication date: 15 September 1994

Full work available at URL: https://doi.org/10.2307/2153582

zbMATH Keywords

complexitypolynomial-time algorithmunits in number fieldsdivisor cascading

Mathematics Subject Classification ID

Units and factorization (11R27) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (2)

Computing the binomial part of a polynomial ideal ⋮ On factor refinement in number fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating rings of integers in number fields
• Factor Refinement
• Asymptotically Fast Triangularization of Matrices over Rings
• Algorithms in Algebraic Number Theory

This page was built for publication: Recognizing Units in Number Fields