认识大数据计算的可追溯性
Recognizing the Tractability in Big Data Computing
摘要:
由于现有计算机计算能力的限制,多项式时间不适用于识别大数据计算中的易处理问题。本文采用次线性时间作为新的易处理标准来识别大数据计算中的易处理性,并采用随机存取图灵机作为计算模型来刻画大数据上易处理的问题。首先,提出了两个纯易处理的类。一个是类$\mathrm{PL}$组成的问题,可以解决在多对数时间的RATM。另一类是$\mathrm{ST}$类,它包含了所有可以用RATM在次线性时间内求解的问题。深入研究了这两个纯易处理类的结构,证明了它们是$\mathrm{PL^i} \subsetneq \mathrm{PL^{i+1}}$和$\mathrm{PL} \subsetneq \mathrm{ST}$ .然后,提出了两个伪易处理类:$\mathrm{PTR}$和$\mathrm{PTE}$。$\mathrm{PTR}$包含了所有在PTIME预处理后,通过减少输入数据集的大小,可以在次线性时间内由RATM解决的问题。$\mathrm{PTE}$包含了在PTIME预处理之后,通过扩展输入数据集的大小,在次线性时间内可以由RATM解决的所有问题。研究了这两个伪易处理类与其它复杂性类之间的关系,证明了它们是$\mathrm{PT} \subseteq \mathrm{P}$,$\sqcap'\mathrm{T^0_Q} \subsetneq \mathrm{PTR^0_Q}$和$\mathrm{PT_P} = \mathrm{P}$ .
英文摘要:
Due to the limitation on computational power of existing computers, the polynomial time does not works for identifying the tractable problems in big data computing. This paper adopts the sublinear time as the new tractable standard to recognize the tractability in big data computing, and the random-access Turing machine is used as the computational model to characterize the problems that are tractable on big data. First, two pure-tractable classes are first proposed. One is the class $\mathrm{PL}$ consisting of the problems that can be solved in polylogarithmic time by a RATM. The another one is the class $\mathrm{ST}$ including all the problems that can be solved in sublinear time by a RATM. The structure of the two pure-tractable classes is deeply investigated and they are proved $\mathrm{PL^i} \subsetneq \mathrm{PL^{i+1}}$ and $\mathrm{PL} \subsetneq \mathrm{ST}$. Then, two pseudo-tractable classes, $\mathrm{PTR}$ and $\mathrm{PTE}$, are proposed. $\mathrm{PTR}$ consists of all the problems that can solved by a RATM in sublinear time after a PTIME preprocessing by reducing the size of input dataset. $\mathrm{PTE}$ includes all the problems that can solved by a RATM in sublinear time after a PTIME preprocessing by extending the size of input dataset. The relations among the two pseudo-tractable classes and other complexity classes are investigated and they are proved that $\mathrm{PT} \subseteq \mathrm{P}$, $\sqcap'\mathrm{T^0_Q} \subsetneq \mathrm{PTR^0_Q}$ and $\mathrm{PT_P} = \mathrm{P}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。