562 search results - page 77 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
147
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
FLAIRS
2004
14 years 11 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
NIPS
2008
14 years 11 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
103
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...