Recognizing the tractability in big data computing

DOI10.1007/978-3-030-36412-0_18MaRDI QIDQ6830409zbMATH OpenFDO

Authors Xiang-Yu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu

Publication date 13 May 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_18

zbMATH Keywords

complexity theorysublineartractabilitybig data computing

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Recognizing the tractability in big data computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830409)