7 search results - page 2 / 2 » A Counterexample to Strong Parallel Repetition |
ICPP
1990
IEEE
13 years 8 months ago
1990
IEEE
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of sequential consistency. For implementing sequential consistency in a cache-base...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...