Sublinear-time reductions for big data computing (Q5970839): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Recognizing the tractability in big data computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Samplesort: A Sampling Approach to Minimal Storage Tree Sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-first search is inherently sequential / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fine-Grained Complexity Theory (Tutorial) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Range searching on uncertain data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5116480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sorted Range Reporting / rank | |||
Normal rank |
Latest revision as of 03:12, 30 July 2024
scientific article; zbMATH DE number 7585792
Language | Label | Description | Also known as |
---|---|---|---|
English | Sublinear-time reductions for big data computing |
scientific article; zbMATH DE number 7585792 |
Statements
Sublinear-time reductions for big data computing (English)
0 references
16 September 2022
0 references
big data computing
0 references
sublinear-time tractability
0 references
reduction techniques
0 references
completeness
0 references