Publications associées à Domaine booléen

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 ...

IEEE2024

Three-Input Gates for Logic Synthesis

Giovanni De Micheli, Mathias Soeken, Dewmini Sudara Marakkalage, Eleonora Testa, Heinz Riener

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Packing the Boolean lattice with copies of a poset

Istvan Tomon

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 ...

WILEY2020

On the Number of Containments in P-free Families

Abhishek Methuku

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

Springer2019

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Winston Jason Haaswijk

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 ...

EPFL2019

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

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

The Myers-Steenrod Theorem For Finsler Manifolds Of Low Regularity

Marc Troyanov

We prove a version of Myers-Steenrod's theorem for Finsler manifolds under the minimal regularity hypothesis. In particular we show that an isometry between C-k,C-alpha-smooth (or partially smooth) Finsler metrics, with k + alpha > 0, k is an element of N ...

Amer Mathematical Soc2017

Near-UV to red-emitting charged bis-cyclometallated iridium(III) complexes for light-emitting electrochemical cells

Michael Graetzel, Mohammad Khaja Nazeeruddin, Rosario Scopelliti, Davide Di Censo

Herein we report a series of charged iridium complexes emitting from near-UV to red using carbene-based (NC)-C-boolean AND: ancillary ligands. Synthesis, photophysical and electrochemical properties of this series are described in detail together with X-ra ...

Royal Society of Chemistry2012

A Global Version Of The Darboux Theorem With Optimal Regularity And Dirichlet Condition

Bernard Dacorogna, Olivier Kneuss

Let n > 2 be even; r >= 1 be an integer; 0 < alpha < 1; Omega be a bounded, connected, smooth, open set in R-n; and nu be its exterior unit normal. Let f, g is an element of C-r,C-alpha((Omega) over bar; Lambda(2)) be two symplectic forms (i.e., closed and ...

2011