NP problems
Description: NP problems are decision problems whose proposed solutions can be verified in polynomial time by a deterministic algorithm.
Primary topic: Complexity and Algorithms in Graphs (26%)
Wikidata ID: wiki/Q628036
OpenAlex ID: keywords/np-problems
