文件名称：The Nature of Computation
文件大小：19.29MB
文件格式：PDF
更新时间：2021-11-09 08:27:39
计算理论 计算机科学
This book gives a lucid and playful explanation of the field, starting with P and NP-completeness. The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.