840 search results - page 163 / 168 » Inapproximability of Combinatorial Optimization Problems |
102
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
113
Voted
IPL
2010
14 years 11 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
104
Voted
EUROCRYPT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
122
click to vote
TIT
2010
14 years 7 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
112
Voted
ICCS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...