Dagstuhl Seminar Proceedings: The Constraint Satisfaction Problem: Complexity and Approximability 2009

> Home > Series > Dagstuhl Seminar Proceedings

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/2009P9441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2009P9441
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009. Dagstuhl Seminar Proceedings 09441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/BulatovGKK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BulatovGKK09
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability.
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/BulatovGKK09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BulatovGKK09a
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability.
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/ValerioteBC09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/ValerioteBC09
Matthew Valeriote, Simone Bova, Hubie Chen:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/Willard09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/Willard09
Ross Willard:
PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE.
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/MartinM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/MartinM09
Barnaby Martin, Jos Martin:
The complexity of positive first-order logic without equality II: The four-element case.

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.