Discrete Mathematics category: 175 books

Precharge logic is used by a variety of industries in applications where processor speed is the primary goal, such as VLSI (very large systems integration) applications. Also called dynamic logic, this type of design uses a clock to synchronize instructions in circuits. This comprehensive book covers...

This book constitutes extended, revised and selected papers from the 7th International Conference on Optimization Problems and Their Applications, OPTA 2018, held in Omsk, Russia in July 2018. The 27 papers presented in this volume were carefully reviewed and selected from a total of 73 submissions....

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we...

In this book we develop powerful techniques based on formal methods for the verification of correctness, consistency and safety properties related to dynamic reconfiguration and communication in complex distributed systems. In particular, static analysis techniques based on types and type systems...

The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other...

This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification...

Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial...

This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum...

En el pasado el autor desarrollo un método nuevo para la simplificación de funciones booleanas basados un una propiedad que señala que minterms son parte o no de una función dada. Se usaron fractales para lograr generar las tablas de verdad de todos los posibles minterms. En esta ocasión se utiliza...

En el pasado el autor desarrollo un método nuevo para la simplificación de funciones booleanas basados un una propiedad que señala que minterms son parte o no de una función dada. Se usaron fractales para lograr generar las tablas de verdad de todos los posibles minterms. En esta ocasión se utiliza...

El autor plantea un método para la simplificación de funciones booleanas que dado resultados prácticos . Se toman en consideración los métodos conocidos, y propuestos por otros autores, y se estima el grado de dificultad de cada uno. También se toma en cuenta el grado total de posibles pruebas...

Written for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs: the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, Seidel matrix,...

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects...

Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-date survey about the state of the art of homomorphic signature schemes. First,...