scientific article; zbMATH DE number 5874901

MaRDI QIDQ5391189zbMATH OpenFDO

Authors Přemysl Jedlička

Publication date 6 April 2011

Full work available at URL https://eudml.org/doc/226042

zbMATH Keywords

integral minimizationnumber field sievepolynomial selectionSkewed polynomialsSteepest descent

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• A polynomial algorithm for minimal interval representation
• Optimization methods for a class of integer polynomial programming problems
• scientific article; zbMATH DE number 5823944
• A polynomial algorithm for minimizing discrete convic functions in fixed dimension
• Integer Polynomial Optimization in Fixed Dimension
• On the optimality of pseudo-polynomial algorithms for integer programming
• On the optimality of pseudo-polynomial algorithms for integer programming
• Efficient implementation of minimal polynomial and reduced rank extrapolation methods
• Integration and optimization of multivariate polynomials by restriction onto a random subspace

Cited in

(4)

• Accelerating optimization by tracing valley
• On nonlinear polynomial selection and geometric progression (mod N) for number field sieve
• Better polynomials for GNFS
• On polynomial selection for the general number field sieve

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 Q5391189)