Advanced Boolean Techniques

Rolf Drechsler is head of Cyber-Physical Systems department at the German Research Center for Artificial Intelligence (DFKI) since 2011. Furthermore, he is a Full Professor at the Institute of Computer Science, University of Bremen, since 2001. Before, he worked for the Corporate Technology Department of Siemens AG, and was with the Institute of Computer Science, Albert-Ludwig University of Freiburg/Breisgau, Germany. Rolf Drechsler received the Diploma and Dr. Phil. Nat. degrees in computer science from the Goethe-University in Frankfurt/Main, Germany, in 1992 and, respectively, 1995. Rolf Drechsler focusses in his research at DFKI and in the Group for Computer Architecture, which he is heading at the Institute of Computer Science of the University of Bremen, on the development and design of data structures and algorithms with an emphasis on circuit and system design. Mathias Soeken works as a researcher at the Integrated Systems Laboratory at EPFL,Lausanne, Switzerland. From 2009 to 2015 he worked at the University of Bremen, Germany. He holds a Ph.D. degree (Dr.-Ing.) in Computer Science from University of Bremen, Germany (2013). His main field of research is logic synthesis. He is considering new methods for combinatorial logic optimization and investigating the application of logic synthesis beyond digital circuit design. Most notably, his research resulted in algorithms for scalable automatic quantum compilation. Other targeted applications are formal verification and cryptography. He is maintaining the logic synthesis and quantum compilation frameworks CirKit and RevKit, which are part of the EPFL Logic Synthesis Libraries. Mathias Soeken is member of the IEEE and of the ACM.

• Chapter 1. Self-Explaining Digital Systems: Technical View, Implementation Aspects, and Completeness.- Chapter 2.Secure Implementation of Lattice-Based Encryption Schemes.- Chapter 3. Derivative Operations for Classes CN of Boolean Functions.- Chapter 4.Towards the Structure of a Class of Permutation Matrices Associated With Bent Functions.- Chapter 5. Improving SAT Solving Using
Monte Carlo Tree Search-based Clause Learning.- Chapter 6.Synthesis of Majority Expressions through Primitive Function Manipulation.- Chapter 7. Literal Selection in Switching Lattice Design.- Chapter 8. Exact Synthesis of ESOP Forms.- Chapter 9.An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions.- Chapter 10.New Results on Reversible Boolean Functions Having Component Functions with Specified Properties.- Chapter 11. Efficient hardware operations for the residue number system by Boolean minimization.