{"id":"https://openalex.org/keywords/conp","display_name":"coNP","description":"coNP is a computational complexity class containing decision problems whose complements can be verified in polynomial time.","display_name_alternatives":["co-NP"],"ids":{"openalex":"https://openalex.org/keywords/conp","wikidata":"https://www.wikidata.org/wiki/Q955748"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3755,"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.3755,"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":371,"cited_by_count":8495,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/conp","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
