← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

1 第1章 算法在计算中的作用

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.651Z

To be precise, only decision problems—those with a “yes/no” answer—can be NP-complete. The decision version of the traveling salesperson problem asks whether there exists an order of stops whose distance totals at most a given amount.

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter001.xhtml#footnote_2

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea