P, NP, and NP-Completeness: The Basics of Computational Complexity 豆 0.0分

资源最后更新于 2020-11-20 04:56:50

作者：Oded Goldreich

出版社：Cambridge University Press

出版日期：2010-01

ISBN：9780521122542

文件格式： pdf

标签： 计算机科学 NP问题 TCS NPC 2010

简介· · · · · ·

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder th...