未找到相关数据
Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
被引：0
|作者：
Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge
[1
]
MA, United States
机构：
来源：
Leibniz Int. Proc. Informatics, LIPIcs
|
关键词：
Compilation and indexing terms;
Copyright 2024 Elsevier Inc;
D O I：
34
中图分类号：
学科分类号：
摘要：
Best-known algorithms - Fine grained - Linear-time solutions - Longest common subsequence problem - Longest common subsequences - Single source shortest paths - Sparse graphs - Time hierarchy
引用
收藏
相关论文