P, NP, and NP-Completeness pdf epub mobi txt 電子書下載 2024

☆☆☆☆☆
簡體網頁||繁體網頁

Oded Goldreich

Cambridge University Press

2010-8-16

214

USD 37.99

Paperback

9780521122542

圖書標籤: 計算機科學 NP問題 TCS NPC 2010

喜歡 P, NP, and NP-Completeness 的讀者還喜歡

下載链接在页面底部

點擊這裡下載

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

想要找書就要到小哈圖書下載中心

qciss.net

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

发表于2024-11-24

P, NP, and NP-Completeness epub 下載 mobi 下載 pdf 下載 txt 電子書下載 2024

P, NP, and NP-Completeness pdf epub mobi txt 電子書下載 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 下載 mobi epub pdf txt 電子書