subcubic algorithms
Description: Algorithms for computational problems whose running time grows asymptotically more slowly than the cubic-time bound in the relevant input size.
Primary topic: Complexity and Algorithms in Graphs (69%)
Related topic: Complexity and Algorithms in Graphs (69%)
OpenAlex ID: keywords/subcubic-algorithms
