Discrete Mathematics category: 175 books

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone...

Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software...

This revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying formal languages and compilation. Retaining the reader-friendly style of the 1st edition, this versatile textbook describes the essential principles and methods used for defining the syntax...

A Relaxation Based Approach to Optimal Control of Hybrid and Switched Systems proposes a unified approach to effective and numerically tractable relaxation schemes for optimal control problems of hybrid and switched systems. The book gives an overview of the existing (conventional and newly developed)...

Modular Forms is a graduate student-level introduction to the classical theory of modular forms and computations involving modular forms, including modular functions and the theory of Hecke operators. It also includes applications of modular forms to various subjects, such as the theory of quadratic...

Probabilistic Design for Optimization and Robustness: Presents the theory of modeling with variation using physical models and methods for practical applications on designs more insensitive to variation. Provides a comprehensive guide to optimization and robustness for probabilistic design. Features...

Dieses Dokument beschreibt eine bestimmte einfache Aufgabe welche in NP liegt, nicht jedoch in P. Eine Aufgabe vorweisen zu können welche in NP liegt jedoch nicht in P ist hinreichend um zu zeigen, dass P ungleich NP ist. In seiner wissenschaftlichen Ausarbeitung "THE P VS NP PROBLEM" stellt...