P, NP, and NP-Completeness 2024 pdf epub mobi 电子书

☆☆☆☆☆
简体网页||繁体网页

P, NP, and NP-Completeness 2024 pdf epub mobi 电子书著者简介

P, NP, and NP-Completeness 电子书图书目录

下载链接在页面底部

点击这里下载

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到本本书屋

onlinetoolsland.com

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-11-09

P, NP, and NP-Completeness 2024 pdf epub mobi 电子书

喜欢 P, NP, and NP-Completeness 电子书的读者还喜欢

P, NP, and NP-Completeness 电子书读后感

评分☆☆☆☆☆

类似图书点击查看全场最低价

出版者:Cambridge University Press

作者:Oded Goldreich

出品人:

页数:214

译者:

出版时间:2010-8-16

价格:USD 37.99

装帧:Paperback

isbn号码:9780521122542

丛书系列:

图书标签: 计算机科学 NP问题 TCS NPC 2010

P, NP, and NP-Completeness 2024 pdf epub mobi 电子书图书描述

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 2024 pdf epub mobi 电子书

想要找书就要到本本书屋

onlinetoolsland.com

立刻按 ctrl+D收藏本页

你会得到大惊喜!!