NP
Description: A computational complexity class containing decision problems solvable by a nondeterministic Turing machine in polynomial time.
Primary topic: Complexity and Algorithms in Graphs (39%)
Wikidata ID: wiki/Q628036
OpenAlex ID: keywords/np
