{"id":"https://openalex.org/keywords/comparison-complexity","display_name":"comparison complexity","description":"A measure of an algorithm\u2019s computational cost that counts the comparisons it performs, especially in string and search problems.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/comparison-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.5035,"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.5035,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2776,"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":145,"cited_by_count":2398,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/comparison-complexity","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
