NP completeness(NP完整性)(Introduction to Algorithms, 算法导论,CLRS)学习笔记

NP completeness Here we use binary string in our problems; Call an instance of a problem language, and x ∈ { 0 , 1 } ∗ x\in\{0,1\}^* x∈{0,1}∗ means the input of the language x is encoded in binary; A
相关文章
相关标签/搜索