Cook在介绍千禧年难题“The P versus NP Problem”[1]时说: -The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time. 这就是NP完备理论中P和NP的形式化定义:P ...