机读格式显示(MARC)
- 000 01666nam2 2200397 4500
- 008 060221r20062006cc a b 001 0 eng d
- 017 __ |a 图字:01-2005-3985
- 020 __ |a 7302122601 |c CNY68.00
- 050 _4 |a QA76.9.A43 |b K54 2006
- 099 __ |a CAL 022006011140
- 100 1_ |a Kleinberg, Jon.
- 245 10 |a Algorithm design = |b 算法设计 / |c Jon Kleinberg, Eva Tardos 著.
- 260 __ |a 北京 : |b 清华大学出版社, |c 2006.
- 300 __ |a xxiii, 838 p. : |b ill. ; |c 24 cm.
- 440 _0 |a 大学计算机教育国外著名教材系列
- 504 __ |a Includes 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 __ |p Reprint. Originally published: |c Boston : Pearson/Addison-Wesley, c2006. |z 0321295358.
- 650 _0 |a Data structures (Computer science)
- 650 _0 |a Computer algorithms.
- 905 __ |a XATU |d TP301.6/5E
- 950 __ |a 261060 |f TP301.6/5
- 999 __ |t C |A shenxiaoyan |a 20070320 09:37:14 |M shenxiaoyan |m 20070320 09:38:23 |G shenxiaoyan |g 20070320 10:20:0