书目信息 |
书名: | Algorithm design = | |
作者: | Jon Kleinberg, ?va Tardos著. | |
分册号: | ||
分册名: | 出版地: | 北京 : |
|
出版社: | 清华大学出版社 | |
出版时间: | 2006. | |
页数: | xxi, 838 p. : | |
开本: | 24 cm. | |
丛书名: | 大学计算机教育国外著名教材系列 | |
中图分类号: | ||
科图分类号: | ||
其他分类号: | H31:TP301 | |
主题词: | ||
电子资源: |
000 | 05290cam a2202125 a 4500 | |
001 | 00000117248 | |
003 | CAL | |
005 | 20140325085842.51 | |
008 | 060221r20062006cc a b 001 0 eng d | |
020 | @a9787302122609. | |
040 | @aTSU@cTSU@dPUL@dSCT | |
041 | 0 | @aeng@bchi |
050 | 4 | @aQA76.9.A43@bK54 2006 |
082 | 04 | @a005.1@222 |
093 | @aTP301.6@24 | |
099 | @dH31:TP301@e3 | |
100 | 1 | @aKleinberg, Jon. |
245 | 10 | @aAlgorithm design =@b算法设计 / @cJon Kleinberg, ?va Tardos著. |
246 | 31 | @a算法设计 |
260 | @a北京 :@b清华大学出版社,@c2006. | |
300 | @axxi, 838 p. :@bill. ;@c24 cm. | |
440 | 0 | @a大学计算机教育国外著名教材系列 |
504 | @aIncludes bibliographical references (p. [805]-814) and index. | |
505 | 0 | @a"Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever." |
534 | @pReprint. Originally published:@cBoston : Pearson/Addison-Wesley, c2006.@z0321295358. | |
650 | 0 | @aComputer algorithms. |
650 | 0 | @aData structures (Computer science) |
700 | 1 | @aTardos, ?va. |
905 | @a241250 | |
920 | @a211030@z2 | |
920 | @a211050@z2 | |
920 | @a211168@z1 | |
920 | @a212010@z1 | |
920 | @a211060@z1 | |
920 | @a211090@z2 | |
920 | @a211010@z2 | |
920 | @aF44010@z2 | |
920 | @a231400@z1 | |
920 | @a242120@z1 | |
920 | @a235030@z1 | |
920 | @a245010@z2 | |
920 | @a211130@z1 | |
920 | @a241061@z1 | |
920 | @a211260@z1 | |
920 | @a244180@z2 | |
920 | @a222010@z1 | |
920 | @a233020@z2 | |
920 | @a231010@z2 | |
920 | @a241031@z1 | |
920 | @a242020@z1 | |
920 | @a251020@z2 | |
920 | @a236010@z2 | |
920 | @a261020@z1 | |
920 | @a261030@z2 | |
920 | @a243160@z2 | |
920 | @a211270@z1 | |
920 | @a234030@z1 | |
920 | @a242250@z1 | |
920 | @a237020@z1 | |
920 | @a244070@z1 | |
920 | @a262010@z2 | |
920 | @a231280@z2 | |
920 | @a221020@z1 | |
920 | @a244050@z1 | |
920 | @a231030@z2 | |
920 | @a251430@z2 | |
920 | @a232090@z2 | |
920 | @a235010@z2 | |
920 | @a244020@z1 | |
920 | @a223140@z1 | |
920 | @a221120@z1 | |
920 | @a212020@z1 | |
920 | @a251050@z1 | |
920 | @a231220@z1 | |
920 | @a251010@z1 | |
920 | @a211100@z1 | |
920 | @a242010@z1 | |
920 | @a241010@z1 | |
920 | @a243040@z1 | |
920 | @a232010@z2 | |
920 | @a246040@z1 | |
920 | @a244010@z1 | |
920 | @a242030@z2 | |
920 | 1 | @a234050@z1 |
920 | 1 | @a234010@z1 |
920 | 1 | @a234080@z1 |
920 | 1 | @a234160@z1 |
920 | 1 | @a221070@z1 |
920 | @a211070@z1 | |
920 | @a211162@z1 | |
920 | @a244290@z1 | |
920 | 1 | @a211111@z1 |
920 | 1 | @a244056@z1 |
920 | 1 | @a211261@z1 |
920 | 1 | @a222342@z1 |
920 | 1 | @a222240@z1 |
920 | 1 | @a211361@z1 |
920 | 1 | @a211340@z1 |
920 | 1 | @a221190@z1 |
920 | 1 | @a244450@z1 |
920 | 1 | @a221130@z1 |
920 | 1 | @a221110@z1 |
920 | 1 | @a221700@z1 |
920 | 1 | @a244055@z1 |
920 | 1 | @a245020@z1 |
920 | 1 | @a245120@z1 |
920 | 1 | @a244370@z1 |
920 | 1 | @a242240@z1 |
920 | 1 | @a242163@z1 |
920 | 1 | @a223060@z1 |
920 | 1 | @a234040@z1 |
920 | 1 | @a223010@z1 |
920 | 1 | @a241180@z1 |
920 | 1 | @a243031@z1 |
920 | 1 | @a235020@z1 |
920 | 1 | @a242365@z1 |
920 | 1 | @a215140@z1 |
920 | 1 | @a236060@z1 |
920 | 1 | @a222110@z1 |
920 | 1 | @a244021@z1 |
920 | 1 | @a236120@z1 |
920 | 1 | @a236200@z1 |
920 | 1 | @a242280@z1 |
920 | 1 | @a237240@z1 |
920 | 1 | @a221490@z1 |
920 | 1 | @a221080@z1 |
920 | 1 | @a237290@z1 |
920 | 1 | @a235280@z1 |
920 | 1 | @a213050@z1 |
920 | 1 | @a243325@z1 |
920 | 1 | @a221060@z1 |
920 | 1 | @a221063@z1 |
920 | 1 | @a233025@z1 |
920 | 1 | @a232330@z1 |
920 | @a211040@z2 | |
920 | 1 | @a233104@z1 |
920 | 1 | @a232390@z1 |
920 | 1 | @a264070@z1 |
920 | 1 | @a223101@z1 |
920 | 1 | @a237050@z1 |
920 | @a211020@z2 | |
920 | 1 | @a242430@z1 |
920 | 1 | @a237410@z1 |
920 | 1 | @a237010@z1 |
920 | 1 | @a232020@z1 |
920 | 1 | @a244380@z1 |
920 | 1 | @a231000@z1 |
920 | 1 | @a213095@z1 |
920 | 1 | @a261220@z1 |
920 | 1 | @a244030@z1 |
920 | 1 | @a251040@z1 |
920 | 1 | @a214010@z1 |
920 | 1 | @a221050@z1 |
920 | 1 | @a232101@z1 |
920 | 1 | @a212130@z1 |
920 | 1 | @a231020@z1 |
920 | 1 | @a233170@z1 |
920 | 1 | @a244067@z1 |
920 | 1 | @a231151@z1 |
920 | 1 | @a242050@z1 |
920 | 1 | @a299008@z1 |
920 | 1 | @a242140@z1 |
920 | 1 | @a261060@z1 |
920 | 1 | @a261050@z1 |
920 | 1 | @a265051@z1 |
920 | 1 | @a261011@z1 |
920 | 1 | @a222020@z1 |
920 | 1 | @a253190@z1 |
920 | 1 | @a213015@z1 |
920 | 1 | @a232181@z1 |
920 | 1 | @a244285@z1 |
920 | 1 | @a233080@z1 |
920 | 1 | @a233610@z1 |
920 | 1 | @a233250@z1 |
920 | 1 | @a235170@z1 |
920 | @a215010@z2 | |
920 | 1 | @a211080@z1 |
920 | 1 | @a211670@z1 |
920 | 1 | @a222201@z1 |
998 | @aTSU | |
Algorithm design = : 算法设计 / / Jon Kleinberg, ?va Tardos著.-北京 : : 清华大学出版社, , 2006. |
xxi, 838 p. : : ill. ; ; 24 cm.- (大学计算机教育国外著名教材系列) |
Includes bibliographical references (p. [805]-814) and index.-"Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever." |
ISBN 9787302122609. |
● |
相关链接 |
正题名:Algorithm design
索取号:H31:TP301/3
 
预约/预借
序号 | 登录号 | 条形码 | 馆藏地/架位号 | 状态 | 备注 |
1 | 0710153 | 207101535 | 样本书库/4110970502/ [索取号:H31:TP301/3] | 在馆 | |
2 | 0710154 | 207101544 | 西文书库/4110970502/ [索取号:H31:TP301/3] | 在馆 | |
3 | 0710155 | 207101553 | 西文书库/4110970502/ [索取号:H31:TP301/3] | 在馆 | |
4 | 0710156 | 207101562 | 西文书库/4110970502/ [索取号:H31:TP301/3] | 在馆 |