LEADER 02410nam  2200601I  450 
001 9910463721303321
005 20190419503000.0
010   $a0-429-29492-1
010   $a1-56881-574-3
010   $a1-4398-6379-2
035   $a(CKB)3400000000002148
035   $a(OCoLC)560284432
035   $a(CaPaEBR)ebrary10159701
035   $a(SSID)ssj0000276775
035   $a(PQKBManifestationID)11237832
035   $a(PQKBTitleCode)TC0000276775
035   $a(PQKBWorkID)10226736
035   $a(PQKB)10548081
035   $a(MiAaPQ)EBC3059497
035   $a(Au-PeEL)EBL3059497
035   $a(CaPaEBR)ebr10159701
035   $a(OCoLC)922955591
035   $a(FlBoTFG)9780429294921
035   $a(EXLCZ)993400000000002148
100   $a20190417d2002      uy             0
101 0 $aeng
135   $aur|||   |||||
181   $ctxt
182   $cc
183   $acr
200 10$aAlgorithms and Complexity /$fby Herbert S. Wilf
205   $a2nd ed.
210  1$aBoca Raton, FL :$cTaylor and Francis, an imprint of A K Peters/CRC Press,$d2002.
215   $a1 online resource (229 p.) 
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a1-56881-178-0 
320   $aIncludes bibliographical references and index.
330 3 $aThis book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
606   $aProblem solving$xData processing
606   $aComputer algorithms
606   $aComputational complexity
608   $aElectronic books.
615  0$aProblem solving$xData processing.
615  0$aComputer algorithms.
615  0$aComputational complexity.
676   $a511/.8
700   $aWilf$b Herbert S.$012671
801  0$bFlBoTFG
801  1$bFlBoTFG
906   $aBOOK
912   $a9910463721303321
996   $aAlgorithms and complexity$9975756
997   $aUNINA