9842 search results - page 226 / 1969 » Problem complexity |
133
Voted
EUROCRYPT
2012
Springer
13 years 5 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...
119
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
103
Voted
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
123
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
127
Voted
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...