Computer Science / CS 0162 · Atom · ~20 seconds
The Class NP
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
State
The nondeterministic polynomial class, NP, holds every problem solvable in polynomial time by a nondeterministic algorithm — a machine free to explore all choices at once, succeeding if any path succeeds.
Show
A puzzle cracked by trying every move simultaneously is the class's thought experiment.
Watch for
No such machine exists; the class is definition, not hardware.