runtime complexity
Description: A measure of how an algorithm’s computational resource use, typically time, grows with input size, studied in algorithms and term rewriting.
Related topic: Logic, programming, and type systems (11%)
OpenAlex ID: keywords/runtime-complexity
