跳到内容
Algorithms unlocked 预览资料
关闭预览资料
正在查...

Algorithms unlocked

著者: Thomas H Cormen
出版商: Cambridge, Massachusetts : The MIT Press, [2013]
版本/格式:   图书 : 英语查看所有的版本和格式
数据库:WorldCat
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在线查找

与资料的链接

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

材料类型: 互联网资源
文件类型: 书, 互联网资源
所有的著者/提供者: Thomas H Cormen
ISBN: 9780262518802 0262518805
OCLC号码: 813540952
描述: xiii, 222 pages : illustrations ; 23 cm
内容: What are algorithms and why should you care? --
How to describe and evaluate computer algorithms --
Algorithms for sorting and searching --
A lower bound for sorting and how to beat it --
Directed acyclic graphs --
Shortest paths --
Algorithms on strings --
Foundations of cryptography --
Data compression --
Hard? Problems.
责任: Thomas H. Cormen.

评论

社评

出版商概要

"Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract 再读一些...

 
用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

相关主题:(4)

这资料的用户列表 (6)

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/813540952>
library:oclcnum"813540952"
library:placeOfPublication
owl:sameAs<info:oclcnum/813540952>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"2013"
schema:description"What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1337771363>
schema:inLanguage"en"
schema:name"Algorithms unlocked"@en
schema:url
schema:workExample

Content-negotiable representations

关闭窗口

请登入WorldCat 

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