跳至内容
Computational complexity 線上預覽
關閉線上預覽
正在查...

Computational complexity

作者: Christos H Papadimitriou
出版商: Reading, Mass. : Addison-Wesley, ©1994.
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

其他的實體格式: Online version:
Papadimitriou, Christos H.
Computational complexity.
Reading, Mass. : Addison-Wesley, c1994
(OCoLC)654178169
文件類型: 圖書
所有的作者/貢獻者: Christos H Papadimitriou
ISBN: 0201530821 9780201530827 0020153082 9780020153085
OCLC系統控制編碼: 28421912
描述: xv, 523 p. : ill. ; 25 cm.
内容: Pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability --
Pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic --
Pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP --
Pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space --
Pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond
責任: Christos H. Papadimitriou.
更多資訊:

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個

類似資料

相關主題:(4)

提供給讀者有關此資料的清單 (1)

確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/28421912>
library:oclcnum"28421912"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/28421912>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity."@en
schema:name"Computational complexity"@en
schema:about
schema:about
schema:copyrightYear"1994"
schema:creator
schema:datePublished"1994"
schema:description"Pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- Pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- Pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- Pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- Pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond"@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/30840215>
schema:inLanguage"en"
schema:name"Computational complexity"@en
schema:numberOfPages"523"
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.