Optimization, games, and quantified constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 239-250

  Chen, Hubie ^a   Pál, Martin ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMIZATION;

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DICHOTOMY THEOREM; OPTIMIZATION PROBLEMS; QUANTIFIED CONSTRAINT SATISFACTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048895043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_16     Document Type: Article

References (9)

1. B. Aspvall, M.F. Plass, R.E. Tarjan. A linear time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, vol 8 no. 3, 1979.
2. E. Böhler, N. Creignou, S. Reith and H. Vollmer. Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory. ACM SIGACT-Newsletter, 34(4):38-52, 2003.
3. Ferdinand Börner, Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. Quantified Constraints: Algorithms and Complexity. Computer Science Logic, 2003.
4. Andrei Bulatov, Andrei Krokhin, Peter Jeavons. Constraint satisfaction problems and finite algebras. Proceedings of ICALP'00, Lecture Notes in Computer Science 1853, 272-282.
5. Nadia Creignou, Sanjeev Khanna, Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, 2001.
6. D. Gusfield, L. Pitt. A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica, 8:103-117, 1992.
7. Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt. On the Computational Complexity of Quantified Horn Clauses. Computer Science Logic, 1987, 129-137.
8. S. Khanna, M. Sudan, L. Trevisan and D.P. Williamson. The Approximability of Constraint Satisfaction Problems. SIAM Journal on Computing, 30:1863-1920, 2001.
9. Thomas J. Schaefer. The complexity of satisfiability problems. Proceedings of the Tenth ACM Symposium on Theory of Computing, pp. 216-226, 1978.