Cook's Theorem — Study Resources & PYQs

Cook's theorem

Estimated study time: 33 minutes

Study resources

Non-Deterministic Algorithms / Satisfiability / Cook's Theorem (Video) — Video lecture by Abdul Bari covering NP-Hard, NP-Complete, satisfiability, and reductions visually.

Cook's Theorem previous year questions

(a) Define NP-Hard and NP-Complete Problems. (b) What are the steps used to show a given problem is NP-Complete ? (c) State and explain Cook's theorem.

Taught in these subjects

Analysis & Design of Algorithms — CST-3501 · Government College of Engineering and Technology, Jammu

Open on CachedInfo