6 citations · 20 across the 15 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2017★ 1 cited
The complexity of quantified constraints using the algebraic formulation
Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk
Let A be an idempotent algebra on a finite domain. We combine results of Chen, Zhuk and Carvalho et al. to argue that if A satisfies the polynomially generated powers property (PGP…
cs.LO2015
Switchability and collapsibility of Gap Algebras
Barnaby Martin, Dmitriy Zhuk
Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not αβ-projective (for some alpha, beta subsets of D) and is not collapsible. I…