Sciweavers

4757 search results - page 25 / 952
» A Unique
Sort
View
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
14 years 3 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
COCO
2003
Springer
98views Algorithms» more  COCO 2003»
14 years 3 months ago
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Chris Calabro, Russell Impagliazzo, Valentine Kaba...
FOCS
2002
IEEE
14 years 2 months ago
Explicit Unique-Neighbor Expanders
Noga Alon, Michael R. Capalbo
STOC
2010
ACM
149views Algorithms» more  STOC 2010»
14 years 2 months ago
Graph Expansion and the Unique Games Conjecture
Prasad Raghavendra and David Steurer