fine-grained complexity
Description: A subfield of computational complexity theory that studies precise running-time bounds and lower bounds for computational problems.
Primary topic: Complexity and Algorithms in Graphs (41%)
Wikidata ID: wiki/Q141254051
OpenAlex ID: keywords/fine-grained-complexity
