implicit computational complexity
Description: A field of theoretical computer science that studies computational complexity through programming-language and logical characterizations rather than explicit resource bounds.
Primary topic: Logic, programming, and type systems (75%)
Wikidata ID: wiki/Q30324433
OpenAlex ID: keywords/implicit-computational-complexity
