Concept
Boolean domain
Related publications (17)
In Medio Stat Virtus: Combining Boolean and Pattern Matching
Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi
Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...
2024Packing the Boolean lattice with copies of a poset
The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...
WILEY2020On the Number of Containments in P-free Families
A subfamily {F-1, F-2, ..., F-vertical bar P vertical bar} subset of F is a copy of the poset P if there exists a bijection i : P -> {F-1, F-2, ..., F-vertical bar P vertical bar}, such that p
Springer2019SAT-Based Exact Synthesis for Multi-Level Logic Networks
Today, the design of electronic systems is largely automated. The practice of using software automation technologies for the design of electronic hardware is commonly referred to as Electronic Design Automation (EDA). EDA comprises a large set of tools, fr ...
EPFL2019Almost tiling of the Boolean lattice with copies of a poset
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...
ELECTRONIC JOURNAL OF COMBINATORICS2018