Discrete Mathematics

Concentration inequalities for functions of independent random variables is an area of probability theory that has witnessed a great revolution in the last few decades, and has applications in a wide variety of areas such as machine learning, statistics,...

Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition,...

A practical guide simplifying discrete math for curious minds and demonstrating its application in solving problems related to software development, computer algorithms, and data scienceKey FeaturesApply the math of countable objects to practical...

This book introduces a new geometric vision of continued fractions. It covers several applications to questions related to such areas as Diophantine approximation, algebraic number theory, and toric geometry. The second edition now includes a geometric...

Designed for the non-specialist, this classic text by a world expert is an invaluable reference tool for those interested in a basic understanding of the subject. Exercises, notes and exhaustive references follow each chapter, making it outstanding both...

Can a Christian escape from a lion? How quickly can a rumour spread? Can you fool an airline into accepting oversize baggage? Recreational mathematics is full of frivolous questions where the mathematician's art can be brought to bear. But play often has...

Algebraic coding theory is a new and rapidly developing subject, motivated by immediate practical applications, but also rich in mathematical structure. This book provides an elementary yet rigorous introduction to the theory of error-correcting codes...

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are...

As the sophistication of cyber-attacks increases, understanding how to defend critical infrastructure systems-energy production, water, gas, and other vital systems-becomes more important, and heavily mandated. Industrial Network Security, Third Edition...

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased...

Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing and information systems. The subject is covered in a gentle and informal style, but without compromising the need for correct methodology. It is...

This easy-to-understand textbook introduces the mathematical language and problem-solving tools essential to anyone wishing to enter the world of computer and information sciences. Specifically designed for the student who is intimidated by mathematics,...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486483689Author Gary ChartrandFormat PaperbackPage Count 464Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams)...

Active student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author - an award-winning teacher - writes in a...

This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included...

Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and...

This introduction to the theory of rigid structures explains how to analyze the performance of built and natural structures under loads, paying special attention to the role of geometry. The book unifies the engineering and mathematical literatures by...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780262660716Author Benjamin C. PierceFormat PaperbackPage Count 116Imprint MIT PressPublisher MIT Press LtdWeight(grams) 227gDimensions(mm) 229mm * 178mm *...

This book is an introduction, for mathematics students, to the theories of information and codes. They are usually treated separately but, as both address the problem of communication through noisy channels (albeit from different directions), the authors...

Collecting data is relatively easy, but turning raw information into something useful requires that you know how to extract precisely what you need. With this insightful book, intermediate to experienced programmers interested in data analysis will learn...

Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating...

CISSP (R) Study Guide, Fourth Edition provides the latest updates on CISSP (R) certification, the most prestigious, globally-recognized, vendor neutral exam for information security professionals. In this new edition, readers will learn about what's...

Game theory is the science of interaction. This textbook, derived from courses taught by the author and developed over several years, is a comprehensive, straightforward introduction to the mathematics of non-cooperative games. It teaches what every game...

Sorry no description is available for this book at this time.

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and...

A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete...

Applied Math for Security is one of the first math-based guides specifically geared for information security practitioners. Readers will learn how to use concepts from various fields of mathematics - like graph theory, computational geometry, and...

Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey...

The past decade has seen numerous major mathematical breakthroughs for topics such as the finite field Kakeya conjecture, the cap set conjecture, Erdos's distinct distances problem, the joints problem, as well as others, thanks to the introduction of new...

This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares,...

Critical coding techniques have developed over the past few decades for data storage, retrieval and transmission systems, significantly mitigating costs for governments and corporations that maintain server systems containing large amounts of data. This...

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science...

Paul Erdos published more papers during his lifetime than any other mathematician, especially in discrete mathematics. He had a nose for beautiful, simply-stated problems with solutions that have far-reaching consequences across mathematics. This...

The flourishing topic of arc routing presents many challenges that lie at the heart of modern operations research. Written by world-renowned researchers, this book provides a thorough and up-to-date discussion of arc routing. Organized by problem type,...

This book is a practical guide to the numerical solution of linear and nonlinear equations, differential equations, optimization problems, and eigenvalue problems. It treats standard problems and introduces important variants such as sparse systems,...

Sorry no description is available for this book at this time.

This undergraduate text is designed for a single-semester introductory course in discrete mathematics. It is aimed at students of mathematics and computer science, as well as problem-solving enthusiasts or anyone with some familiarity with proofs seeking...

This book constitutes the refereed proceedings of the 18th International Conference on Graph Transformation, ICGT 2025, held in Koblenz, Germany, during June 11-12, 2025.The 10 full papers and 1 short paper included in this book were carefully reviewed...

The Memoirs of the AMS is devoted to the publication of new research in all areas of pure and applied mathematics. The Memoirs is designed particularly to publish long papers of groups of cognate papers in book form, and is under the supervision of the...

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint...