Linked e-resources
Details
Table of Contents
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 MONteCarlo 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.
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 MONteCarlo 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.