137 search results - page 2 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
122
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
128
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
102
click to vote
WSC
2007
15 years 4 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
113
Voted
ISSAC
1998
Springer
15 years 6 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
ICDIM
2007
IEEE
15 years 8 months ago
2007
IEEE
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...