20 citations · 75 across the 44 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016
On the Chen Conjecture regarding the complexity of QCSPs
Barnaby Martin
Let A be an idempotent algebra on a finite domain. We combine results of Chen 2008 and Zhuk 2015 to argue that if Inv(A) satisfies the polynomially generated powers property (PGP),…
cs.LO2016
Constraint satisfaction problems for reducts of homogeneous graphs
Manuel Bodirsky, Barnaby Martin, Michael Pinsker +1
For , let denote the -th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed t…