原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
Technically, we also require the functions f12 and f21 to “map noninstances to noninstances.” A noninstance of an encoding e is a string x ∈ {0, 1}* such that there is no instance i for which e(i) = x. We require that f12(x) = y for every noninstance x of encoding e1, where y is some noninstance of e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml#footnote_6
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea