subexponential algorithms
Description: Algorithms whose running time grows faster than polynomial time but slower than exponential time, often studied in computational number theory.
Primary topic: Advanced Graph Theory Research (36%)
OpenAlex ID: keywords/subexponential-algorithms
