Sciweavers

58
Voted
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 2 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