{"id":"https://openalex.org/keywords/p-completeness","display_name":"#P-completeness","description":"A property of computational problems that are complete for the complexity class P under an appropriate reduction, capturing their parallel computation difficulty.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/p-completeness","wikidata":"https://www.wikidata.org/wiki/Q905789"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2668,"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.2668,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.1981,"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":1332,"cited_by_count":25065,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/p-completeness","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
