572 search results - page 11 / 115 » Exponential-Time Approximation of Hard Problems |
ASIACRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
RANDOM
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...