scientific article

From MaRDI portal
Publication:3326837

zbMath0539.68030MaRDI QIDQ3326837

Arjen K. Lenstra

Publication date: 1983


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

Roots of unity in ordersFactoring sparse multivariate polynomialsIrreducibility of multivariate polynomialsComputation of lattice isomorphisms and the integral matrix similarity problemDiscovering the Roots: Uniform Closure Results for Algebraic Classes Under FactoringFactoring multivariate polynomials via partial differential equationsBounded-degree factors of lacunary multivariate polynomialsComputer algebra: Past and futureInversion in finite fields using logarithmic depthHilbert subsets and \(s\)-integral pointsKummer theory for number fields via entanglement groupsAlgorithms in Algebraic Number Theory-adic images of Galois for elliptic curves over (and an appendix with John Voight)On the normalization of numbers and functions defined by radicalsNorm relations and computational problems in number fieldsComputing primitive elements of extension fieldsIs every matrix similar to a polynomial in a companion matrix?Factoring polynomials over global fields. II.List decoding of number field codesDeterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemesKronecker's and Newton's approaches to solving: a first comparisonThe computation of polynomial greatest common divisors over an algebraic number fieldA polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic functionIrreducibility testing over local fieldsIdeal forms of Coppersmith's theorem and Guruswami-Sudan list decodingA Polynomial Time Complexity Bound for Computations on CurvesComputing groups of Hecke charactersA note on locality of algebras




This page was built for publication: