scientific article
From MaRDI portal
Publication:3686034
zbMath0569.68030MaRDI QIDQ3686034
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)
Related Items
Meta-heuristic approaches to solve shortest lattice vector problem, Bounding basis reduction properties, Towards faster polynomial-time lattice reduction, On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems, A hierarchy of polynomial time lattice basis reduction algorithms, Segment LLL reduction of lattice bases using modular arithmetic, 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, Computing with an algebraic-perturbation variant of Barvinok's algorithm, A heuristic irreducibility test for univariate polynomials, La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász, Factoring polynomials and the knapsack problem, Selected Applications of LLL in Number Theory, Factoring polynomials over global fields, Random lattices, threshold phenomena and efficient reduction algorithms.
