PPT
Part VI NP-Hardness. Lecture 23 What’s NP?. Hard Problems. Answer. What is NP-complete? What is NP-hard? First, what is NP?. Answer 1. NP means “ N ot P olynomial-time computable”. Wrong! Did you learn automata theory before ?. Answer 2. Still wrong! But, almost true.