SIGACT news complexity theory column 43

This issue’s column is the conclusion of the two-parter started last issue. Warmest thanks to the authors, and happy theorems to all. The columns to appear in this year’s other issues will be Andris Ambainis on quantum algorithms and quantum lower bounds, Venkatesan Guruswami on codes and expanders, and John Hitchcock, Jack Lutz, and Elvira Mayordomo on the fractal geometry of complexity classes.

[1]  Luca Trevisan,et al.  Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[2]  Laurent Juban,et al.  Dichotomy Theorem for the Generalized Unique Satisfiability Problem , 1999, FCT.

[3]  Peter Jonsson,et al.  Recognizing frozen variables in constraint satisfaction problems , 2004, Theor. Comput. Sci..

[4]  Uri Zwick,et al.  Finding almost-satisfying assignments , 1998, STOC '98.

[5]  Heribert Vollmer,et al.  Equivalence and Isomorphism for Boolean Constraint Satisfaction , 2002, CSL.

[6]  Peter Jeavons,et al.  An Algebraic Characterization of Tractable Constraints , 1995, COCOON.

[7]  David P. Williamson,et al.  A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.

[8]  Nadia Creignou,et al.  A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[9]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[10]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[11]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[12]  Nicholas Pippenger,et al.  Theories of computability , 1997 .

[13]  Phokion G. Kolaitis.  Constraint Satisfaction, Databases, and Logic , 2003, IJCAI.

[14]  Marc Gyssens,et al.  How to Determine the Expressive Power of Constraints , 1999, Constraints.

[15]  Nadia Creignou,et al.  Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[16]  Heribert Vollmer,et al.  Optimal satisfiability for propositional calculi and constraint satisfaction problems , 2003, Inf. Comput..

[17]  Nadia Creignou.  Complexity Versus Stability for Classes of Propositional Formulas , 1998, Inf. Process. Lett..

[18]  Reinhard Pöschel.  Galois Connections for Operations and Relations , 2004 .

[19]  Nadia Creignou,et al.  On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..

[20]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[21]  Martha Sideri,et al.  The Inverse Satisfiability Problem , 1996, SIAM J. Comput..

[22]  Rina Dechter,et al.  Structure Identification in Relational Data , 1992, Artif. Intell..

[23]  Phokion G. Kolaitis,et al.  The complexity of minimal satisfiability problems , 2001, Inf. Comput..

[24]  L. A. Kaluzhnin,et al.  Galois theory for Post algebras. II , 1969 .

[25]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[26]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[27]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

[28]  Heribert Vollmer,et al.  The Complexity of Boolean Constraint Isomorphism , 2003, STACS.

[29]  Reinhard Pöschel,et al.  Funktionen- und Relationenalgebren , 1979 .