The complexity of making unique choices: Approximating 1-in-k SAT

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 99-110

  Guruswami, Venkatesan ^a   Trevisan, Luca ^b  

^a University of Washington   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEM; MAX KSAT;

APPROXIMATION THEORY;

EID: 26944498625     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_9     Document Type: Conference Paper

References (9)

1. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCP's and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
2. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 861-870, 2000.
3. A. Clementi, P. Crescenzi, A. Monti, P. Penna, and R. Silvestri. On computing ad-hoc selective families. In Proceedings of RANDOM'01, 2001.
4. E. Demaine, U. Feige, M. Hajiaghayi, and M. Salavatipour. Combination can be hard: approximability of the unique coverage problem. Manuscript, April 2005.
5. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
6. V. Guruswami. Query-efficient checking of proofs and improved PCP characterizations of NP. Master's thesis, MIT, 1999.
7. V. Guruswami, J. Hartline, A. Karlin, D. Kempe, C. Kenyon, and F. McSherry. On profit-maximizing envy-free pricing. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2005.
8. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
9. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226, 1978.