原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
e problems. We describe them informally here, with formal definitions to appear later on.
The class P consists of those problems that are solvable in polynomial time. More specifically, they are problems that can be solved in O(nk) time for some constant k, where n is the size of the input to the problem. Most of the problems examined in previous chapters belong to P. The class NP consists of those problems that are “verifiable” in polynomial time. What do we mean by a problem being verifiable? If you were somehow given a “certificate” of a solution, then
you could verify that the certificate is correct in time polynomial in the size of the in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea