Matches in Library of Congress for { <http://lccn.loc.gov/2005000401> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- 2005000401 contributor B10104433.
- 2005000401 contributor B10104434.
- 2005000401 created "c2006.".
- 2005000401 date "2006".
- 2005000401 date "c2006.".
- 2005000401 dateCopyrighted "c2006.".
- 2005000401 description "Includes bibliographical references (p. [805]-814) and index.".
- 2005000401 description "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.".
- 2005000401 extent "xxiii, 838 p. :".
- 2005000401 identifier "0321295358 (alk. paper)".
- 2005000401 identifier 2005000401.html.
- 2005000401 issued "2006".
- 2005000401 issued "c2006.".
- 2005000401 language "eng".
- 2005000401 publisher "Boston : Pearson/Addison-Wesley,".
- 2005000401 subject "005.1 22".
- 2005000401 subject "Computer algorithms.".
- 2005000401 subject "Data structures (Computer science)".
- 2005000401 subject "QA76.9.A43 K54 2006".
- 2005000401 tableOfContents "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.".
- 2005000401 title "Algorithm design / Jon Kleinberg, Éva Tardos.".
- 2005000401 type "text".