2313 search results - page 188 / 463 » On Heuristic Time Hierarchies |
152
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
177
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
155
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
154
click to vote
UAI
2003
15 years 8 months ago
2003
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
195
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...