NP-completeness 2 P versus NP problem
there many equivalent ways of describing np-completeness.
let l language on finite alphabet Σ.
l np-complete if, , if, following 2 conditions satisfied:
alternatively, if l ∈ np, , there np-complete problem can polynomial-time reduced l, l np-complete. common way of proving new problem np-complete.
Comments
Post a Comment