P, NP, and NP-Completeness 在线电子书 图书标签: 计算机科学 NP问题 TCS NPC 2010
发表于2024-11-22
P, NP, and NP-Completeness 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024
留个足迹,完整读完了~充满哲学的味道~
评分留个足迹,完整读完了~充满哲学的味道~
评分留个足迹,完整读完了~充满哲学的味道~
评分留个足迹,完整读完了~充满哲学的味道~
评分留个足迹,完整读完了~充满哲学的味道~
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 than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
评分
评分
评分
评分
P, NP, and NP-Completeness 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024