LEADER 01577nam a2200313 i 4500
001 991003696749707536
008 080609s2006    maua     b    001 0 eng d
020   $a0321372913
035   $ab13738604-39ule_inst
040   $aDip.to Matematica$beng
082 04$a005.1$222
084   $aAMS 68M10
084   $aLC QA76.9.A43K54
100 1 $aKleinberg, Jon$0598658
245 10$aAlgorithm design /$cJon Kleinberg, Eva Tardos
260   $aBoston :$bPearson/Addison-Wesley,$cc2006
300   $axxiii, 838 p. :$bill. ;$c24 cm
504   $aIncludes bibliographical references (p. [805]-814) and index
505 0 $aIntroduction: 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
650  0$aComputer algorithms
650  0$aData structures (Computer science)
700 1 $aTardos, Eva$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0433592
856 41$zTable of contents$uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html
907   $a.b13738604$b28-01-14$c09-06-08
912   $a991003696749707536
945   $aLE013 68M KLE11 (2006)$g1$i2013000208077$lle013$op$pE79.95$q-$rl$s-  $t0$u8$v7$w8$x0$y.i14778257$z17-06-08
996   $aAlgorithm design$91028082
997   $aUNISALENTO
998   $ale013$b09-06-08$cm$da  $e-$feng$gmau$h0$i0