Dagstuhl Seminar Proceedings 09441

The Constraint Satisfaction Problem: Complexity and Approximability

A. A. Bulatov, M. Grohe, P. G. Kolaitis, A. Krokhin (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 09441, 25.10. - 30.10.2009
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Bova, Simone
  • Bulatov, Andrei A.
  • Chen, Hubie
  • Grohe, Martin
  • Kolaitis, Phokion G.
  • Krokhin, Andrei
  • Martin, Barnaby
  • Martin, Jos
  • Valeriote, Matt
  • Willard, Ross
    		•

    		  
    09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability
    Authors: Bulatov, Andrei A. ; Grohe, Martin ; Kolaitis, Phokion G. ; Krokhin, Andrei

    Abstract | Document (209 KB) | BibTeX

    09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability
    Authors: Bulatov, Andrei A. ; Grohe, Martin ; Kolaitis, Phokion G. ; Krokhin, Andrei

    Abstract | Document (74 KB) | BibTeX

    On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
    Authors: Valeriote, Matt ; Bova, Simone ; Chen, Hubie

    Abstract | Document (396 KB) | BibTeX

    PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE
    Authors: Willard, Ross

    Abstract | Document (247 KB) | BibTeX

    The complexity of positive first-order logic without equality II: The four-element case
    Authors: Martin, Barnaby ; Martin, Jos

    Abstract | Document (251 KB) | BibTeX

    		  



    DROPS-Home | Imprint | Privacy
    Published by LZI