1 citations · 2 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Sublinear-time Reductions for Big Data Computing
Xiangyu Gao, Jianzhong Li, Dongjing Miao
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 t…
cs.CC2019★ 1 cited
Recognizing the Tractability in Big Data Computing
Xiangyu Gao, Jianzhong Li, Dongjing Miao +1
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 adop…