6 citations · 20 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.LO2018
The number of clones determined by disjunctions of unary relations
Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set . We…
cs.CC2018★ 2 cited
A modification of the CSP algorithm for infinite languages
Dmitriy Zhuk
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that…