  We introduce the framework of the left-hand side restricted promise
constraint satisfaction problem, which includes problems like approximating
clique number of a graph. We study the parameterized complexity of problems in
this class and provide some initial results. The main technical contribution is
a sufficient condition for W[1]-hardness which, in particular, covers left-hand
side restricted bounded arity CSPs.
