Login / Signup
The Constraint Satisfaction Problem: Complexity and Approximability
2009
2009
2009
Keyphrases
Publications
2009
Barnaby Martin
,
Jos Martin
The complexity of positive first-order logic without equality II: The four-element case.
The Constraint Satisfaction Problem: Complexity and Approximability
(2009)
Andrei A. Bulatov
,
Martin Grohe
,
Phokion G. Kolaitis
,
Andrei A. Krokhin
09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability.
The Constraint Satisfaction Problem: Complexity and Approximability
(2009)
Ross Willard
PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE.
The Constraint Satisfaction Problem: Complexity and Approximability
(2009)
Matthew Valeriote
,
Simone Bova
,
Hubie Chen
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
The Constraint Satisfaction Problem: Complexity and Approximability
(2009)
Andrei A. Bulatov
,
Martin Grohe
,
Phokion G. Kolaitis
,
Andrei A. Krokhin
09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability.
The Constraint Satisfaction Problem: Complexity and Approximability
(2009)
volume 9441, 2009
The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009
The Constraint Satisfaction Problem: Complexity and Approximability
9441 (2009)