Book Description
Contains all the mathematics that computer scientists need to know in one place.
Author : Guerino Mazzola
Publisher : Springer Science & Business Media
Page : 452 pages
File Size : 47,7 MB
Release : 2006-09-20
Category : Computers
ISBN :
Contains all the mathematics that computer scientists need to know in one place.
Author : Guerino Mazzola
Publisher : Springer Science & Business Media
Page : 376 pages
File Size : 13,33 MB
Release : 2004
Category : Computer science
ISBN : 9783540208358
This two-volume textbook is a self-contained yet comprehensive presentation of mathematics. The numerous course examples are motivated by computer science and bear a generic scientific meaning. For the second edition the entire text has been carefully re-written. Many examples and illustrations have been added, and explanations have been clarified. This makes the book more accessible to both instructors and students.
Author : Clifford Stein
Publisher :
Page : 525 pages
File Size : 49,93 MB
Release : 2011
Category : Computer science
ISBN : 9780131377103
Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.
Author : Eric Lehman
Publisher :
Page : 988 pages
File Size : 40,46 MB
Release : 2017-03-08
Category : Business & Economics
ISBN : 9789888407064
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Author : Ronald L. Graham
Publisher : Addison-Wesley Professional
Page : 811 pages
File Size : 24,41 MB
Release : 1994-02-28
Category : Computers
ISBN : 0134389980
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.
Author : Guerino Mazzola
Publisher : Springer Science & Business Media
Page : 390 pages
File Size : 25,40 MB
Release : 2006-10-05
Category : Computers
ISBN : 3540368744
Contains all the mathematics that computer scientists need to know in one place.
Author : Harry Lewis
Publisher : Princeton University Press
Page : 408 pages
File Size : 25,54 MB
Release : 2019-03-19
Category : Computers
ISBN : 0691179298
Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.
Author : John Vince
Publisher : Springer
Page : 341 pages
File Size : 50,90 MB
Release : 2015-07-27
Category : Computers
ISBN : 3319214373
John Vince describes a range of mathematical topics to provide a foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus. Readers will find that the author's visual approach will greatly improve their understanding as to why certain mathematical structures exist, together with how they are used in real-world applications. Each chapter includes full-colour illustrations to clarify the mathematical descriptions, and in some cases, equations are also coloured to reveal vital algebraic patterns. The numerous worked examples will consolidate comprehension of abstract mathematical concepts. Foundation Mathematics for Computer Science covers number systems, algebra, logic, trigonometry, coordinate systems, determinants, vectors, matrices, geometric matrix transforms, differential and integral calculus, and reveals the names of the mathematicians behind such inventions. During this journey, John Vince touches upon more esoteric topics such as quaternions, octonions, Grassmann algebra, Barycentric coordinates, transfinite sets and prime numbers. Whether you intend to pursue a career in programming, scientific visualisation, systems design, or real-time computing, you should find the author’s literary style refreshingly lucid and engaging, and prepare you for more advanced texts.
Author : Benjamin C. Pierce
Publisher : MIT Press
Page : 117 pages
File Size : 43,50 MB
Release : 1991-08-07
Category : Computers
ISBN : 0262326450
Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Contents Tutorial • Applications • Further Reading
Author : Joe L. Mott
Publisher :
Page : 774 pages
File Size : 33,14 MB
Release : 1986
Category : Combinatorial analysis
ISBN :