{"id":"https://openalex.org/keywords/linear-space-complexity","display_name":"linear space complexity","description":"A computational resource bound in which an algorithm uses memory proportional to the input size.","display_name_alternatives":["O(n) space complexity","linear memory complexity","linear space usage","linear space"],"ids":{"openalex":"https://openalex.org/keywords/linear-space-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.2092,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.2092,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.0706,"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":146,"cited_by_count":6959,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/linear-space-complexity","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
