Book of Donmon Teith

Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of

This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented f

This book introduces a novel approach to discrete optimization, providing both theoretical insights and algorithmic developments that lead to improvements over

Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and test

This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of C