{"id":"https://openalex.org/keywords/o-n-algorithm","display_name":"O(N) algorithms","description":"Algorithms whose running time grows linearly with input size, arising in fields including numerical computing, physics, and optimization.","display_name_alternatives":["O(n) time algorithms","linear time complexity algorithms"],"ids":{"openalex":"https://openalex.org/keywords/o-n-algorithm","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.1057,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.0738,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":431,"cited_by_count":15535,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/o-n-algorithm","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
