3 citations · 3 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Uniform CSP Parameterized by Solution Size is in W[1]
Ruhollah Majdoddin
We show that the uniform Constraint Satisfaction Problem (CSP) parameterized by the size of the solution is in W[1] (the problem is W[1]-hard and it is easy to place it in W[3]). G…
cs.CC2017★ 3 cited
Parameterized Complexity of CSP for Infinite Constraint Languages
Ruhollah Majdoddin
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraint…