机读格式显示(MARC)

• 000 01641cam a2200385 a 4500

• 001 0000372103

• 003 CAL

• 005 20200929144400.0

• 008 190528r20192006cc ac b 000 0 eng d

• 017 __ |a CN |b 01-2017-9237

• 020 __ |a 9787115495921 (pbk.) |c CNY138.00

• 040 __ |a BUA |c BUA |d SCT

• 041 1_ |a eng |b chi

• 050 _4 |a QA76.9.A43 |b K54 2006

• 082 04 |a 005.1 |2 22

• 090 __ |a TP301.6/E12

• 093 __ |a TP301.6 |2 5

• 099 __ |a CAL 022019049026

• 100 1_ |a Kleinberg, Jon. |e author.

• 245 10 |a Algorithm design / |c Jon Kleinberg, ?va Tardos = 算法设计 / 乔恩·克莱因伯格, 伊娃·塔多斯著.

• 246 31 |a 算法设计

• 260 __ |a 北京 : |b 人民邮电出版社, |c 2019.

• 300 __ |a ix, vii, 814 p. : |b ill., ports. ; |c 24 cm.

• 336 __ |a text |2 rdacontent

• 337 __ |a unmediated |2 rdamedia

• 338 __ |a volume |2 rdacarrier

• 504 __ |a Includes bibliographical references (p. [805]-814)

• 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 New York: Pearson Education, c2006. |z 0321295358(alk. paper)

• 546 __ |a Copyright statement preface and contents in Chinese.

• 650 _0 |a Computer algorithms.

• 650 _0 |a Data structures (Computer science)

• 700 1_ |a Tardos, ?va.

• 920 __ |a 261060 |z 1

• 998 __ |a BUA