{"id":"https://openalex.org/keywords/np-optimization-problems","display_name":"NP optimization problems","description":"NP optimization problems are computational optimization problems whose candidate solutions can be verified in polynomial time.","display_name_alternatives":["NP optimisation problems","NP optimization problem","NP optimisation problem","NPO problems","nondeterministic polynomial-time optimization problems"],"ids":{"openalex":"https://openalex.org/keywords/np-optimization-problems","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6262,"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.6262,"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.1887,"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":107,"cited_by_count":3213,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/np-optimization-problems","updated_date":"2026-11-18T04:07:20","created_date":"2022-04-12T19:38:12"}
