{"id":"https://openalex.org/keywords/o-n-2-algorithm","display_name":"O(n^2) algorithm","description":"An algorithm whose running time grows quadratically with input size, used in computational problems across fields such as graph theory and numerical analysis.","display_name_alternatives":["O(n^2) algorithms","algorithm with quadratic time complexity"],"ids":{"openalex":"https://openalex.org/keywords/o-n-2-algorithm","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.1752,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.1725,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1324,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0839,"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"}}],"works_count":270,"cited_by_count":4634,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/o-n-2-algorithm","updated_date":"2026-11-14T04:06:12","created_date":"2026-09-30T00:00:00"}
