Preface
Boolean functions are at the core of today’s computer science and find application in
circuit and system specification, synthesis, design understanding, and cryptography.
The International Workshop on Boolean Problems 1 is a bi-annually held and wellestablished forum to discuss the recent advances on problems related to Boolean
logic and Boolean algebra. In 2018, the 13th edition of the workshop was held in
Bremen, Germany, from September 19th to September 21st. The workshop provided
a forum for researchers and engineers from different disciplines to exchange ideas
as well as to discuss problems and solutions. The workshop is devoted to both
theoretical discoveries and practical applications.
This edited book contains a selection of best papers presented at the workshop.
The papers in this volume demonstrate new accomplishments in the theory of
Boolean functions. Furthermore, several papers illustrate how these results find
their way into important practical applications such as cryptography and design
understanding.
The first two chapters in the book are contributions that resulted from the invited
keynotes at the conference. In Chap. 1, Görschwin Fey and Rolf Drechsler describe
Self-Explaining Digital Systems: Technical View, Implementation Aspects, and
Completeness. In Chap. 2, Tobias Oder, Tobias Schneider, and Tim Güneysu write
about a Secure Implementation of Lattice-Based Encryption Schemes. The following
nine chapters are extended manuscripts based on the workshop handouts. In Chap. 3,
Bernd Steinbach and Christian Posthoff write about Derivative Operations for
Classes C N of Boolean Functions. In Chap. 4, Radomir S. Stankovi´ c, Milena
Stankovi´ c, Jaakko T. Astola, and Claudio Moraga investigate bent functions in
Towards the Structure of a Class of Permutation Matrices With Bent Functions.
Oliver Keszocze, Kenneth Schmitz, Jens Schloeter, and Rolf Drechsler show how
to improve the performance of SAT solvers in Improving SAT Solving Using
Monte Carlo Tree Search-based Clause Learning in Chap. 5. The following three
chapters are about logic synthesis applications. In Chap. 6, Evandro C. Ferraz,
1 See www.informatik.uni-bremen.de/iwsbp.
v
Boolean functions are at the core of today’s computer science and find application in
circuit and system specification, synthesis, design understanding, and cryptography.
The International Workshop on Boolean Problems 1 is a bi-annually held and wellestablished forum to discuss the recent advances on problems related to Boolean
logic and Boolean algebra. In 2018, the 13th edition of the workshop was held in
Bremen, Germany, from September 19th to September 21st. The workshop provided
a forum for researchers and engineers from different disciplines to exchange ideas
as well as to discuss problems and solutions. The workshop is devoted to both
theoretical discoveries and practical applications.
This edited book contains a selection of best papers presented at the workshop.
The papers in this volume demonstrate new accomplishments in the theory of
Boolean functions. Furthermore, several papers illustrate how these results find
their way into important practical applications such as cryptography and design
understanding.
The first two chapters in the book are contributions that resulted from the invited
keynotes at the conference. In Chap. 1, Görschwin Fey and Rolf Drechsler describe
Self-Explaining Digital Systems: Technical View, Implementation Aspects, and
Completeness. In Chap. 2, Tobias Oder, Tobias Schneider, and Tim Güneysu write
about a Secure Implementation of Lattice-Based Encryption Schemes. The following
nine chapters are extended manuscripts based on the workshop handouts. In Chap. 3,
Bernd Steinbach and Christian Posthoff write about Derivative Operations for
Classes C N of Boolean Functions. In Chap. 4, Radomir S. Stankovi´ c, Milena
Stankovi´ c, Jaakko T. Astola, and Claudio Moraga investigate bent functions in
Towards the Structure of a Class of Permutation Matrices With Bent Functions.
Oliver Keszocze, Kenneth Schmitz, Jens Schloeter, and Rolf Drechsler show how
to improve the performance of SAT solvers in Improving SAT Solving Using
Monte Carlo Tree Search-based Clause Learning in Chap. 5. The following three
chapters are about logic synthesis applications. In Chap. 6, Evandro C. Ferraz,
1 See www.informatik.uni-bremen.de/iwsbp.
v