Report copyright - More NP N P - Stanford University · NP-Hardness A language L is called NP-hard iff for every L' ∈ NP, we have L' ≤ P L. A language in L is called NP-complete iff L is NP-hard
Please pass captcha verification before submit form
Please pass captcha verification before submit form