NP completeness
A language L ⊆ {0,1}* is NP-complete if
L ∊ NP
L’ ≤p L for every L’ ∊ NP
If a language L satisfies property 2, but not necessarily property 1, we say that L is NP-hard
A language L ⊆ {0,1}* is NP-complete if
L ∊ NP
L’ ≤p L for every L’ ∊ NP
If a language L satisfies property 2, but not necessarily property 1, we say that L is NP-hard