In: Computer Science
A language L is “NP-complete “if the following statements are true about L. Fill out blanks. L is ______________________________; For every language ? ′ in NP, there is a ______________________ reduction of _____________ to ___________.
A language L is “NP-complete “if the following statements are true about L. Fill out blanks. L is NP; For every language ? ′ in NP, there is a polynomial time reduction of L' to L.
Reason :
A language L is NP-complete if language L is NP and every language in NP is reduciable to L in polynomial time.