NP-completeness
Defined in one lecture.
Definitions are written by AI from each lecture’s transcript. The time opens the lecture where the lecturer explains it.
- The property of being the hardest problems in NP, such that every problem in NP can be efficiently reduced to them.10:52Mathematics and Computation: The Landscape of P vs. NPAvi Wigderson · Institute for Advanced Study