{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","description":"The use of algorithms running in polynomial time to find solutions close to optimal for computationally difficult problems.","display_name_alternatives":["approximation in polynomial time"],"ids":{"openalex":"https://openalex.org/keywords/polynomial-time-approximation","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4183,"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.4183,"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":1693,"cited_by_count":38481,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/polynomial-time-approximation","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
