The complexity of soft constraint satisfaction
Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
The complexity of soft constraint satisfaction
Artificial Intelligence
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...