Although much literature exists on the subject of RSA and public-key cryptography, until now there has been no single source that reveals recent developments in the area at an accessible level.
Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.
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.
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.
Eschewing the often standard dry and static writing style of traditional textbooks, Discrete Encounters provides a refreshing approach to discrete mathematics.
Current language technology is dominated by approaches that either enumerate a large set of rules, or are focused on a large amount of manually labelled data.
This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics.
Synchronization of chaotic systems, a patently nonlinear phenomenon, has emerged as a highly active interdisciplinary research topic at the interface of physics, biology, applied mathematics and engineering sciences.
Analytics is the application of mathematical and statistical concepts to large data sets so as to distil insights that offer the owner some options for action and competitive advantage or value.
Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.
The field of artificial economics (AE) embraces a broad range of methodologies relying on computer simulations in order to model and study the complexity of economic and social phenomena.
Brooks' Theorem (1941) is one of the most famous and fundamental theorems in graph theory - it is mentioned/treated in all general monographs on graph theory.
A timely convergence of two widely used disciplines Random Graphs for Statistical Pattern Recognition is the first book to address the topic of random graphs as it applies to statistical pattern recognition.
These Lecture Notes provide an introduction to the study of those discrete surfaces which are obtained by randomly gluing polygons along their sides in a plane.
Discover the Connections between Different Structures and FieldsDiscrete Structures and Their Interactions highlights the connections among various discrete structures, including graphs, directed graphs, hypergraphs, partial orders, finite topologies, and simplicial complexes.
A practical introduction to network science for students across business, cognitive science, neuroscience, sociology, biology, engineering and other disciplines.
The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics.
