1092 search results - page 14 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
106
click to vote
EUROCRYPT
2012
Springer
13 years 2 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
PPSC
1997
15 years 1 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
JCT
2000
14 years 11 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
101
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
108
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...