Recognizing Units in Number Fields

DOI10.2307/2153582zbMATH Open0811.11080OpenAlexW1977949908MaRDI QIDQ4305960FDOQ4305960

Authors: Guoqiang Ge 

Publication date: 15 September 1994

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

Recommendations

• Dependency of units in number fields
• Algorithmic Number Theory
• On the calculation of the units of algebraic number fields
• Computation of Independent Units in Number Fields by Dirichlet's Method
• Algorithms in Algebraic Number Theory

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotically Fast Triangularization of Matrices over Rings
• Algorithms in Algebraic Number Theory
• Approximating rings of integers in number fields
• Factor Refinement

Cited In (6)

• On the calculation of the units of algebraic number fields
• Example for numerical determination of units
• Algorithmic Number Theory
• Computing the binomial part of a polynomial ideal
• Dependency of units in number fields
• On factor refinement in number fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305960)