research
∙
02/27/2023
Functors on relational structures which admit both left and right adjoints
This paper describes several cases of adjunction in the homomorphism ord...
share
research
∙
02/07/2023
On the complexity of the approximate hypergraph homomorphism problem
Understanding the computational complexity of fragments of the Constrain...
research
∙
08/29/2022
An invitation to the promise constraint satisfaction problem
The study of the complexity of the constraint satisfaction problem (CSP)...
research
∙
03/25/2020
Topology and adjunction in promise constraint satisfaction
The approximate graph colouring problem concerns colouring a k-colourabl...
research
∙
04/05/2019
The complexity of 3-colouring H-colourable graphs
We study the complexity of approximation on satisfiable instances for gr...
research
∙
11/02/2018
Algebraic approach to promise constraint satisfaction
The complexity and approximability of the constraint satisfaction proble...
research
∙
11/10/2017
