{"id":"https://openalex.org/keywords/sublinear-time-complexity","display_name":"sublinear time complexity","description":"A computational complexity bound in which an algorithm's running time grows more slowly than the size of its input.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/sublinear-time-complexity","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1214,"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.0969,"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":92,"cited_by_count":3862,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/sublinear-time-complexity","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
