572 search results - page 20 / 115 » Exponential-Time Approximation of Hard Problems |
101
Voted
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
101
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
116
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
101
Voted
ECCC
2007
15 years 13 days ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...