37 citations · 52 across the 9 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2011
Constraint Satisfaction with Counting Quantifiers
Florent Madelaine, Barnaby Martin, Juraj Stacho
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCS…
cs.CC2010
Dichotomy for tree-structured trigraph list homomorphism problems
Tomás Feder, Pavol Hell, David G. Schell +1
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to…