{"id":"https://openalex.org/keywords/subcubic-algorithms","display_name":"subcubic algorithms","description":"Algorithms for computational problems whose running time grows asymptotically more slowly than the cubic-time bound in the relevant input size.","display_name_alternatives":["subcubic algorithm","sub-cubic algorithms","sub-cubic algorithm","subcubic-time algorithms","sub-cubic-time algorithms"],"ids":{"openalex":"https://openalex.org/keywords/subcubic-algorithms","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6878,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6878,"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":114,"cited_by_count":4067,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/subcubic-algorithms","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
