Computational problems, methods, and results in algebraic number theory
From MaRDI portal
Publication:2550420
zbMath0231.12001MaRDI QIDQ2550420
Publication date: 1972
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Related Items
Implementing the Round Four maximal order algorithm, Unnamed Item, Algorithms in Algebraic Number Theory, On Polynomial Factorization Over Finite Fields, Computational Number Theory, Past, Present, and Future, The influence of computers in the development of number theory, Polynomials determining Dedekind domains, Distances from differences of roots of polynomials to the nearest integers, A table of Hecke operators, II, A note on Hilbert class fields of algebraic number fields, Table errata: “Über die Lösung einiger unbestimmten Gleichungen vierten Grades” (Avh. Norske Vid. Akad. Oslo. I. 1934, no. 14. 1–35) by W. Ljunggren, Approximating rings of integers in number fields, An Inequality About Factors of Polynomials, Bounds for the solutions of norm form, discriminant form and index form equations in finitely generated integral domains, Diophantine equation \(x^3-y^2=k\) and Hall's conjecture, Units and class groups in number theory and algebraic geometry, Dyadotropic Polynomials
