15033 search results - page 226 / 3007 » Complexity Theory and Algorithms |
148
Voted
STOC
2009
ACM
16 years 5 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
150
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
150
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
139
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
149
click to vote
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...