The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

Despite its important applications in Machine Learning, min-max optimization of objective
functions that are nonconvex-nonconcave remains elusive. Not only are there no known first …

The smallest integer k needed for the assignment of k colors to the elements so that the
coloring is proper (vertices and edges) is called the total chromatic number of a graph …

Although the theory of random graphs is one of the youngest branches of graph theory, in
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …

Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …

Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

Additive combinatorics is the theory of counting additive structures in sets. This theory has
seen exciting developments and dramatic changes in direction in recent years thanks to its …

Primarily intended for research mathematicians and computer scientists, Combinatorics and
Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students …

Boolean circuit complexity is the combinatorics of computer science and involves many
intriguing problems that are easy to state and explain, even for the layman. This book is a …

The Lovász Local Lemma discovered by Erdős and Lovász in 1975 is a powerful tool to non-
constructively prove the existence of combinatorial objects meeting a prescribed collection …