arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.15330cs.CC
收藏

大数据计算的次线性时间约简

Sublinear-time Reductions for Big Data Computing

Xiangyu Gao, Jianzhong Li, Dongjing Miao

摘要:

随着大数据的快速普及,大数据计算中易处理和难处理问题之间的二分法已经发生了变化。次线性时间,而不是多项式时间,最近被认为是大数据计算中易处理性的新标准。这种变化带来了对大数据背景下计算复杂性理论新方法的需求。在前人对次线性时间复杂度类\cite{DBLP:journals/tcs/GaoLML20}研究的基础上,本文重点研究了大数据计算中的次线性时间约简问题。首先,提出了伪次线性时间约简,证明了复杂性类\Pproblem和\PsT在伪次线性时间约简下是封闭的,为了证明\Pproblem中某些问题的\PsT -难解性,我们找到了$\Pproblem \setminus \PsT$中的第一个问题.利用伪次线性时间约简,我们证明了最近边查询是在\PsT,但代数方程根问题是不是。然后,引入伪多对数时间约简,证明了复杂性类\PsPL在伪多对数时间约简下是封闭的,并证明了在伪多对数时间约简下的\PsT完全性,证明了某些问题在多项式时间预处理后不能在多对数时间内求解,除非\PsT = \PsPL .我们证明了所有的\PsT -完全问题也是\Pproblem -完全的,这为识别\PsT -完全问题提供了进一步的方向.

英文摘要:

With the rapid popularization of big data, the dichotomy between tractable and intractable problems in big data computing has been shifted. Sublinear time, rather than polynomial time, has recently been regarded as the new standard of tractability in big data computing. This change brings the demand for new methodologies in computational complexity theory in the context of big data. Based on the prior work for sublinear-time complexity classes \cite{DBLP:journals/tcs/GaoLML20}, this paper focuses on sublinear-time reductions specialized for problems in big data computing. First, the pseudo-sublinear-time reduction is proposed and the complexity classes \Pproblem and \PsT are proved to be closed under it. To establish \PsT-intractability for certain problems in \Pproblem, we find the first problem in $\Pproblem \setminus \PsT$. Using the pseudo-sublinear-time reduction, we prove that the nearest edge query is in \PsT but the algebraic equation root problem is not. Then, the pseudo-polylog-time reduction is introduced and the complexity class \PsPL is proved to be closed under it. The \PsT-completeness under it is regarded as an evidence that some problems can not be solved in polylogarithmic time after a polynomial-time preprocessing, unless \PsT = \PsPL. We prove that all \PsT-complete problems are also \Pproblem-complete, which gives a further direction for identifying \PsT-complete problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑