The Parameterized Inapproximability Hypothesis (PIH), which is an analog of the PCP theorem in parameterized complexity, asserts that, there is a constant \varepsilon> 0 such that for any computable function f:\mathbb{N}\to\mathbb{N}, no f(k)\cdot n^{O(1)}-time algorithm can, on input a k-variable CSP instance with domain size n, find an assignment satisfying ... more >>>