{"id":"https://openalex.org/keywords/p-np","display_name":"P = NP","description":"The computer science problem of whether every decision problem whose solution can be verified in polynomial time can also be solved in polynomial time.","display_name_alternatives":["P versus NP question"],"ids":{"openalex":"https://openalex.org/keywords/p-np","wikidata":"https://www.wikidata.org/wiki/Q746242"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.346,"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.346,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.1203,"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":227,"cited_by_count":1645,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/p-np","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
