{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":19,"n_cols":5,"rows_kept":19,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[13,2,13,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910788961103321"]
[null,null,"Autore",null,"Wilf Herbert S."]
[null,null,"Titolo",null,"Algorithms and Complexity / / by Herbert S. Wilf"]
[null,null,"Pubbl/distr/stampa",null,"Boca Raton, FL : , : Taylor and Francis, an imprint of A K Peters/CRC Press, , 2002"]
[null,null,"ISBN",null,"0-429-29492-1"]
[{"$nulls":4},"1-56881-574-3"]
[{"$nulls":4},"1-4398-6379-2"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (229 p.)"]
[null,null,"Disciplina",null,"511/.8"]
[null,null,"Soggetti",null,"Problem solving - Data processing"]
[{"$nulls":4},"Computer algorithms"]
[{"$nulls":4},"Computational complexity"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,null,"Sommario/riassunto","This 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."]