{"id":"https://openalex.org/keywords/linear-time-complexity","display_name":"linear time complexity","description":"An algorithmic running-time bound proportional to input size, describing computations that take O(n) time as the input grows.","display_name_alternatives":["O(n) time complexity","linear running time","linear runtime","O(n) running time","linear computational time complexity","o n complexity"],"ids":{"openalex":"https://openalex.org/keywords/linear-time-complexity","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.0849,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":2044,"cited_by_count":64484,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/linear-time-complexity","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
