The Complexity of Making Unique Choices: Approximating 1-in-k SAT

Lecture Notes in Computer Science - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques ◽

10.1007/11538462_9 ◽

2005 ◽

pp. 99-110 ◽

Cited By ~ 4

Author(s):

Venkatesan Guruswami ◽

Luca Trevisan

Download Full-text