Before revision:  We borrow similar proof techniques from \mbox{%DIFAUXCMD Abboud2017 the sub-linear time PCP , and show how to use it to prove both existing and new inapproximability results .
After revision:  We borrow similar proof techniques from \mbox{%DIFAUXCMD Abboud2017 the sub-linear PCP theorem by adapting from an MA-protocol for the Set Containment problem , and show how to use it to prove both existing and new inapproximability results .