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
相關文章
相關標籤/搜索