Sciweavers

4757 search results - page 25 / 952
» A Unique
Sort
View
110
Voted
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 9 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
104
Voted
COCO
2003
Springer
98views Algorithms» more  COCO 2003»
15 years 8 months ago
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Chris Calabro, Russell Impagliazzo, Valentine Kaba...
84
Voted
FOCS
2002
IEEE
15 years 8 months ago
Explicit Unique-Neighbor Expanders
Noga Alon, Michael R. Capalbo
STOC
2010
ACM
149views Algorithms» more  STOC 2010»
15 years 8 months ago
Graph Expansion and the Unique Games Conjecture
Prasad Raghavendra and David Steurer