{"id":"https://openalex.org/keywords/runtime-complexity","display_name":"runtime complexity","description":"A measure of how an algorithm\u2019s computational resource use, typically time, grows with input size, studied in algorithms and term rewriting.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/runtime-complexity","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.1139,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":627,"cited_by_count":13202,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/runtime-complexity","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
