00989nam0 22002651i 450 SUN001893620180725124344.5290.0020040705d1997 |0itac50 baitaIT|||| |||||*Cartografia numericaCesare CambursanoBolognaEsculapio1997658 p.ill.24 cm.001SUN00942152001 Progetto Leonardo210 BolognaEsculapio.BolognaSUNL000003Cambursano, CesareSUNV01503331876EsculapioSUNV000458650ITSOL20181109RICASUN0018936UFFICIO DI BIBLIOTECA DEI DIPARTIMENTI DI INGEGNERIA05 CONS H II 025 05 1960 UFFICIO DI BIBLIOTECA DEI DIPARTIMENTI DI INGEGNERIAIT-CE01001960CONS H II 025caCartografia numerica52519UNICAMPANIA02943oam 2200529 450 991043760330332120190911112725.03-319-01751-910.1007/978-3-319-01751-8(OCoLC)862577718(MiFhGG)GVRL6WLV(EXLCZ)99371000000002434620130807d2013 uy 0engurun|---uuuuatxtccrConcise computer mathematics tutorials on theory and problems /Ovidiu Bagdasar1st ed. 2013.Cham [Switzerland] :Springer,2013.1 online resource (xii, 109 pages) illustrations (some color)SpringerBriefs in Computer Science,2191-5768"ISSN: 2191-5768."3-319-01750-0 Includes bibliographical references and index.Sets and Numbers -- Relations and Databases -- Functions -- Boolean Algebra, Logic and Quantifiers -- Normal Forms, Proof and Argument -- Vectors and Complex Numbers -- Matrices and Applications -- Matrix Transformations for Computer Graphics -- Elements of Graph Theory -- Elements of Number Theory and Cryptography -- Elements of Calculus -- Elementary Numerical Methods.Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.SpringerBriefs in computer science.Computer scienceMathematicsComputer scienceComputational complexityNumber theoryGraph theoryComputer scienceMathematics.Computer science.Computational complexity.Number theory.Graph theory.004.0151Bagdasar Ovidiuauthttp://id.loc.gov/vocabulary/relators/aut1059363MiFhGGMiFhGGBOOK9910437603303321Concise Computer Mathematics2505479UNINA