32 search results - page 2 / 7 » An Extended Semidefinite Relaxation for Satisfiability |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
IPCO
2008
13 years 6 months ago
2008
We consider the standard semidefinite programming (SDP) relaxation for vertex cover to which all hypermetric inequalities supported on at most k vertices have been added. We show t...
MP
2006
13 years 5 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...