Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy |
scientific article; zbMATH DE number 7359371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy |
scientific article; zbMATH DE number 7359371 |
Statements
15 June 2021
0 references
IO model
0 references
fine-grained complexity
0 references
algorithms
0 references
0 references
0.7306116819381714
0 references
0.7060429453849792
0 references
0.7058351039886475
0 references
0.7011123299598694
0 references
