If a problem H is NP-Complete, then.. (Multi-choose) For any problem L in NP, there is a polynomial-time reduction from L to H For any problem L in P, there is a polynomial-time reduction from L to H...

Extracted text: If a problem H is NP-Complete, then.. (Multi-choose) For any problem L in NP, there is a polynomial-time reduction from L to H For any problem L in P, there is a polynomial-time reduction from L to H H belongs to the class P H belongs to the class NP ."An output to problem H is either "yes" or "no