Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
From MaRDI portal
Publication:3800157
DOI10.2307/2007927zbMath0654.12001OpenAlexW4247344077MaRDI QIDQ3800157
László Lovász, Arjen K. Lenstra, Ravindran Kannan
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2007927
algorithmminimal polynomialrandomnesscomputational number theorybinary expansion of an algebraic number
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09)
Related Items
The complexity of approximating the complex-valued Potts model, Algorithms to construct Minkowski reduced and Hermite reduced lattice bases, An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\), Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), Unnamed Item, Deformation techniques to solve generalised Pham systems, Approximating the chromatic polynomial is as hard as computing it exactly, On the hardness of the NTRU problem, Gradual sub-lattice reduction and a new complexity for factoring polynomials, Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, The PSLQ algorithm for empirical data, Splitting full matrix algebras over algebraic number fields., La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász, Kronecker's and Newton's approaches to solving: a first comparison, Selected Applications of LLL in Number Theory, Shapley–Snow Kernels, Multiparameter Eigenvalue Problems, and Stochastic Games, Uniform random number generation, On the hardness of approximating shortest integer relations among rational numbers, New Algorithms for Solving Zero-Sum Stochastic Games, The complexity of approximating the complex-valued Potts model, Renormalization automated by Hopf algebra, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
