93 search results - page 1 / 19 » Conditional hardness for approximate coloring |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
STOC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
HEURISTICS
2006
13 years 4 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
TIT
2011
12 years 12 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...