S. Johnson introduced the concept of Turing reduction and by using this concept intended to make the theory of NP-completeness applicable to an extended class of problems including the combinatorial optimal problems in [3].
英
美
- S.；Johnson在[3]中引入“圖靈歸約”的概念；利用這個(gè)概念把NP完全性理論推廣到包括組合最優(yōu)化問(wèn)題在內的更廣的一類(lèi)問(wèn)題上。
