Discrete mathematics

This book presents a study on the foundations of a large class of paraconsistent logics from the point of view of the logics of formal inconsistency.

Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic

A Beginner's Guide to Mathematical Proof prepares mathematics majors for the transition to abstract mathematics, as well as introducing a wider readership of quantitative science students, such as engineers, to the mathematical structures underlying more applied topics.

Winner of an Outstanding Academic Title Award from CHOICE MagazineMost available cryptology books primarily focus on either mathematics or history.

This book discusses the theory and practice of random number generators that are useful for computer simulation and computer security applications.

Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems.

The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature.

Discrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors, especially those who intend to teach middle and high school mathematics.

Once the privilege of a secret few, cryptography is now taught at universities around the world.

Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures.

In fall 2000, the Notre Dame logic community hosted Greg Hjorth, Rodney G.

This compilation of papers presented at the 2000 European Summer Meeting of the Association for Symbolic Logic marks the centenial anniversery of Hilbert's famous lecture.

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products.

A remarkable interplay exists between the fields of elliptic functions and orthogonal polynomials.

A Guide to the Evaluation of IntegralsSpecial Integrals of Gradshetyn and Ryzhik: the Proofs provides self-contained proofs of a variety of entries in the frequently used table of integrals by I.

Fuzzy social choice theory is useful for modeling the uncertainty and imprecision prevalent in social life yet it has been scarcely applied and studied in the social sciences.

A conference on Nonstandard Methods and Applications in Mathematics (NS2002) was held in Pisa, Italy from June 12-16, 2002.

From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems.

Maps are beguilingly simple structures with deep and ubiquitous properties.

Fixed point theory is a powerful tool in nonlinear analysis, with applications in fractional differential equations and other areas.

Focused on the mathematical foundations of social media analysis, Graph-Based Social Media Analysis provides a comprehensive introduction to the use of graph analysis in the study of social and digital media.

With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications.

With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications.

This classic text, originally from the noted logician Elliot Mendelson, is intended to be an easy-to-read introduction to the basic ideas and techniques of game theory.

Mathematics for Engineers offers a comprehensive treatment of the core mathematical topics required for a modern engineering degree.

No detailed description available for "e;Applied Multivariate Statistical Analysis and Related Topics with R"e;.

This introduction to mathematical logic takes Godel's incompleteness theorem as a starting point.

This book presents articles of L.

Mathematical Theory of Fuzzy Sets presents the mathematical theory of non-normal fuzzy sets such that it can be rigorously used as a basic tool to study engineering and economic problems under a fuzzy environment.

This book presents articles of L.

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and ApplicationsThe Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing.

This third edition presents an expanded and updated treatment of convex analysis methods, incorporating many new results that have emerged in recent years.

This book concisely presents the optimization process and optimal control process with examples and simulations to help self-learning and better comprehension.

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers.

The Mathematical Principles of Natural Philosophy - Isaac Newton - Mathematical Principles of Natural Philosophy ('Philosophiae Naturalis Principia Mathematica'), is a work in three books by Sir Isaac Newton, first published on the 5th July 1687.

Modern Computational Methods for Fractional Differential Equations provides a comprehensive introduction to the fundamentals of fractional calculus.

Combinatorial theory is one of the fastest growing areas of modern mathematics.

This text gives a comprehensive introduction to the "e;common core"e; of convex geometry.

This text gives a comprehensive introduction to the "e;common core"e; of convex geometry.

Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures.