can be shown to be outside of P, then none of the NP-complete problems would have efficient algorithms. The first NP-complete problem was identified by Cook ...
確定! 回上一頁