constant-time algorithms
Description: Constant-time algorithms are computational procedures whose running time remains bounded independently of input size, commonly studied in theoretical computer science.
Wikidata ID: wiki/Q116447150
OpenAlex ID: keywords/constant-time-algorithms
