The inefficiency of polynomial-time ( PTIME ) algorithms in the context big data indicates a departure from traditional view on tractability. In recent years, sublinear-time have been regarded as new standard for tractability computing problems. Based prior work complexity classes [1] , this paper focuses designing appropriate reductions specialized particular, series pseudo-sublinear-time are ...