{"id":"https://openalex.org/keywords/linear-computational-complexity","display_name":"linear computational complexity","description":"Linear computational complexity describes an algorithm whose time or resource requirements grow proportionally to the size of its input.","display_name_alternatives":["O(n) complexity"],"ids":{"openalex":"https://openalex.org/keywords/linear-computational-complexity","wikidata":null},"primary_topic":null,"topics":[],"works_count":1220,"cited_by_count":85933,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/linear-computational-complexity","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
