{"id":"https://openalex.org/keywords/polynomial-time-computability","display_name":"polynomial-time computability","description":"The property of a function or problem being computable by an algorithm whose running time is bounded by a polynomial in input size.","display_name_alternatives":["polynomial-time computable","computability in polynomial time","computable in polynomial time"],"ids":{"openalex":"https://openalex.org/keywords/polynomial-time-computability","wikidata":null},"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.3896,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.3896,"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.1706,"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":518,"cited_by_count":8729,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/polynomial-time-computability","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
