Tractability is obtained by restricting the relations ; in particular , if a problem has width k ( \\ displaystyle k ) .
Is strongly k ( \\ displaystyle k ) - consistent , it is efficiently solvable .
Tractability is obtained by restricting the relations ; in particular , if a problem has width k ( \\ displaystyle k ) and is strongly k ( \\ displaystyle k ) - consistent , it is efficiently solvable .