Factoring polynomials and the knapsack problem
From MaRDI portal
Publication:701105
Recommendations
Cites work
- A unified method for multivariate polynomial factorizations
- An Inequality About Factors of Polynomials
- Analysis of PSLQ, an integer relation finding algorithm
- Factoring polynomials with rational coefficients
- Factorization in Z[x]
- Factorization of differential operators with rational functions coefficients
- scientific article; zbMATH DE number 3823145 (Why is no real title available?)
- scientific article; zbMATH DE number 3909733 (Why is no real title available?)
- scientific article; zbMATH DE number 1852137 (Why is no real title available?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On Hensel factorization. I
- Solving exponential diophantine equations using lattice basis reduction algorithms
- The Magma algebra system. I: The user language
Cited in
(40)- Factoring polynomials over global fields
- Random lattices, threshold phenomena and efficient reduction algorithms.
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Complex spherical codes with three inner products
- Towards faster polynomial-time lattice reduction
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL
- Lifting and recombination techniques for absolute factorization
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Factoring polynomials over global fields. II.
- Fast computation of special resultants
- On the rational summation problem
- A relative van Hoeij algorithm over number fields
- Polynomial factorization algorithms over number fields
- Integral Representation and Algorithms for Closed Form Summation
- Primary decomposition of zero-dimensional ideals over finite fields
- Decidability of univariate real algebra with predicates for rational and integer powers
- Factorization of polynomials and GCD computations for finding universal denominators
- Berlekamp Zassenhaus
- Iterated elliptic and hypergeometric integrals for Feynman diagrams
- scientific article; zbMATH DE number 2145002 (Why is no real title available?)
- Sparse bivariate polynomial factorization
- scientific article; zbMATH DE number 1857497 (Why is no real title available?)
- LLL: a tool for effective Diophantine approximation
- The van Hoeij algorithm for factoring polynomials
- Using LLL-reduction for solving RSA and factorization problems
- The numerical factorization of polynomials
- Valuations of rational solutions of linear difference equations at irreducible polynomials
- Foreword
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
- Modular Las Vegas algorithms for polynomial absolute factorization
- Order bounds for C2-finite sequences
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Formalizing Coppersmith's method in Isabelle/HOL
- Factoring sparse polynomials fast
- Encounters in symbolic computation: ideas for the ages
- Isomorphisms of algebraic number fields
- Towards a modern LLL implementation
- Divisors in residue classes revisited
- Computing with algebraically closed fields
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
This page was built for publication: Factoring polynomials and the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701105)
