scientific article; zbMATH DE number 3909733
From MaRDI portal
Publication:3686034
Recommendations
Cited in
(24)- Factoring polynomials over global fields
- 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
- Factoring polynomials with rational coefficients
- A heuristic irreducibility test for univariate polynomials
- A polynomial time algorithm for diophantine equations in one variable
- Segment LLL reduction of lattice bases using modular arithmetic
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Random lattices, threshold phenomena and efficient reduction algorithms.
- Towards faster polynomial-time lattice reduction
- Bounding basis reduction properties
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
- scientific article; zbMATH DE number 3877318 (Why is no real title available?)
- Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
- scientific article; zbMATH DE number 549859 (Why is no real title available?)
- scientific article; zbMATH DE number 1859220 (Why is no real title available?)
- scientific article; zbMATH DE number 922258 (Why is no real title available?)
- Meta-heuristic approaches to solve shortest lattice vector problem
- Selected applications of LLL in number theory
- Polynomial factorisation: an exploration of Lenstra's algorithm
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Factoring polynomials and the knapsack problem
- Towards a modern LLL implementation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686034)
