{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":36,"n_cols":5,"rows_kept":36,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[13,2,13,3],[13,4,13,5],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[30,2,30,3],[31,2,31,3],[33,2,33,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991003904259707536"]
[null,null,"Autore",null,"Wright, Erik Olin"]
[null,null,"Titolo",null,"Classes / Erik Olin Wright"]
[null,null,"Pubbl/distr/stampa",null,"London ; New York : Verso, 1997, c1985"]
[null,null,"ISBN",null,"9781859841792"]
[null,null,"Descrizione fisica",null,"344 p. ; 22 cm"]
[null,null,"Collana",null,"Verso classics ; 16"]
[null,null,"Disciplina",null,"305.5"]
[null,null,"Soggetti",null,"Classi sociali"]
[{"$nulls":4},"Marxismo [e] Socialismo"]
[null,null,"Lingua di pubblicazione",null,"Non definito"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910416082003321"]
[null,null,"Autore",null,"Kurgalin Sergei"]
[null,null,"Titolo",null,"The Discrete Math Workbook : A Companion Manual Using Python / / by Sergei Kurgalin, Sergei Borzunov"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020"]
[null,null,"ISBN",null,"3-030-42221-6"]
[null,null,"Edizione",null,"[2nd ed. 2020.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVII, 500 p. 333 illus., 19 illus. in color.)"]
[null,null,"Collana",null,"Texts in Computer Science, , 1868-095X"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Professions"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"The Computing Profession"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Fundamentals of Mathematical Logic -- Set Theory -- Relations and Functions -- Combinatorics -- Graphs -- Boolean Algebra -- Complex Numbers -- Recurrence Relations -- Concept of an Algorithm, Correctness of Algorithms -- Turing Machine -- Asymptotic Analysis -- Basic Algorithms -- Parallel Algorithms."]
[null,null,null,"Sommario/riassunto","This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of common challenges and methods for overcoming these. The reader is then encouraged to practice solving such problems for themselves, by tackling a varied selection of questions and assignments of different levels of complexity. This updated second edition now covers the design and analysis of algorithms using Python, and features more than 50 new problems, complete with solutions. Topics and features: Provides a substantial collection of problems and examples of varying levels of difficulty, suitable for both laboratory practical training and self-study Offers detailed solutions to each problem, applying commonly-used "]
[{"$nulls":4},"methods and computational schemes Introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics Presents more advanced material on the design and analysis of algorithms, including Turing machines, asymptotic analysis, and parallel algorithms Includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus This hands-on workbook is an invaluable resource for undergraduate students of computer science, informatics, and electronic engineering. Suitable for use in a one- or two-semester course on discrete mathematics, the text emphasizes the skills required to develop and implement an algorithm in a specific programming language. Dr. Sergei Kurgalin is a Professor and Head of the Department of Digital Technologies at Voronezh State University, Russia. Dr. Sergei Borzunov is an Associate Professor at the same institution."]