An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank

DOI10.1007/s11425-016-9060-2zbMath1414.11167arXiv1406.3523OpenAlexW2963690585MaRDI QIDQ1650656

Yingpu Deng, Dandan Huang

Publication date: 5 July 2018

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3523

zbMATH Keywords

Dedekind domainsbasis representationdeterministic polynomial-time testHermite and Smith normal forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic number theory computations (11Y40)

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial-time locality tests for finite rings
• PRIMES is in P
• Complexity of ring morphism problems
• Fast multiplication of large numbers
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• The Complexity of Black-Box Ring Problems
• Asymptotically Fast Triangularization of Matrices over Rings
• Algorithms in Algebraic Number Theory
• Advanced Topics in Computional Number Theory
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank