Andere Kunden interessierten sich auch für
![Bent Functions]( "Bent Functions")
Bent Functions162,99 €![Topics in Geometry, Coding Theory and Cryptography]( "Topics in Geometry, Coding Theory and Cryptography")
Topics in Geometry, Coding Theory and Cryptography37,99 €![Algebraic Design Theory and Hadamard Matrices]( "Algebraic Design Theory and Hadamard Matrices")
Algebraic Design Theory and Hadamard Matrices74,99 €![Applied Number Theory]( "Applied Number Theory")
Applied Number Theory58,84 €![Algebraic Geometry for Coding Theory and Cryptography]( "Algebraic Geometry for Coding Theory and Cryptography")
Algebraic Geometry for Coding Theory and Cryptography125,99 €![Emerging Applications of Number Theory]( "Emerging Applications of Number Theory")
Emerging Applications of Number Theory38,99 €![Concise Computer Mathematics]( "Concise Computer Mathematics")
Concise Computer Mathematics48,99 €
This illuminating textbook provides a concise review of the core concepts in mathematics essential to computer scientists. Emphasis is placed on the practical computing applications enabled by seemingly abstract mathematical ideas, presented within their historical context. The text spans a broad selection of key topics, ranging from the use of finite field theory to correct code and the role of number theory in cryptography, to the value of graph theory when modelling networks and the importance of formal methods for safety critical systems.
This fully updated new edition has been expanded with a more comprehensive treatment of algorithms, logic, automata theory, model checking, software reliability and dependability, algebra, sequences and series, and mathematical induction.
Topics and features: includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary; describes the historicalcontributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann; introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices; explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory; reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking; covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving; presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus.
This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicianscurious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.
This fully updated new edition has been expanded with a more comprehensive treatment of algorithms, logic, automata theory, model checking, software reliability and dependability, algebra, sequences and series, and mathematical induction.
Topics and features: includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary; describes the historicalcontributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann; introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices; explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory; reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking; covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving; presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus.
This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicianscurious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.
From the reviews:
"This book provides a mathematical context for computing. ... Each chapter concludes with a summary and a series of review questions that reinforce the concepts presented. This is all very readable and self-contained, making the book an excellent resource for most academic libraries. Summing Up: Highly recommended. All undergraduate students and informed general audiences." (D. Z. Spicer, Choice, Vol. 50 (11), July, 2013)
"This book provides a mathematical context for computing. ... Each chapter concludes with a summary and a series of review questions that reinforce the concepts presented. This is all very readable and self-contained, making the book an excellent resource for most academic libraries. Summing Up: Highly recommended. All undergraduate students and informed general audiences." (D. Z. Spicer, Choice, Vol. 50 (11), July, 2013)