Concepts1

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#cook levin theorem
📚TheoryIntermediate

NP-Completeness

NP-completeness classifies decision problems that are both in NP and as hard as any problem in NP via polynomial-time reductions.

#np-complete#np-hard#polynomial-time reduction+12