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 . These results exhibits the power of the sub-linear PCP theorem proposed in this paper . Considering the emerging research works on sub-linear time algorithms, the sub-linear PCP theorem is important in guiding the research in sub-linear time approximation algorithms.
After 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 , exhibiting the power of the sub-linear PCP theorem proposed in this paper . Considering the emerging research works on sub-linear time algorithms, the sub-linear PCP theorem is important in guiding the research in sub-linear time approximation algorithms.