sublinear-time algorithms
Description: Algorithms whose running time grows more slowly than the size of their input, studied in theoretical computer science and large-scale data analysis.
Primary topic: Complexity and Algorithms in Graphs (39%)
OpenAlex ID: keywords/sublinear-algorithms
