P = NP
Description: The computer science problem of whether every decision problem whose solution can be verified in polynomial time can also be solved in polynomial time.
Primary topic: Complexity and Algorithms in Graphs (35%)
Wikidata ID: wiki/Q746242
OpenAlex ID: keywords/p-np
