跳到内容
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 

没有张号吗?很容易就可以 建立免费的账号.