Publications associées à Algèbre de Boole (logique)

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Scalable Logic Rewriting Using Don’t Cares

Giovanni De Micheli, Alessandro Tempia Calvino

Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...

2024

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

2024

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having po ...

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Giovanni De Micheli, Alessandro Tempia Calvino

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing an ...

2024

Succinct ordering and aggregation constraints in algebraic array theories

Viktor Kuncak, Rodrigo Raya

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

Lattice packings through division algebras

Nihar Prakash Gargava

In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...

SPRINGER HEIDELBERG2023

Improving Standard-Cell Design Flow using Factored Form Optimization

Giovanni De Micheli, Alessandro Tempia Calvino

Factored form is a powerful multi-level representation of a Boolean function that readily translates into an implementation of the function in CMOS technology. In particular, the number of literals in a factored form correlates strongly with the number of ...

New York2023

Neuromorphic computing based on halide perovskites

Mohammad Khaja Nazeeruddin, Feng Gao

Neuromorphic computing requires electronic systems that can perform massively parallel computational tasks with low energy consumption. Such systems have traditionally been based on complementary metal-oxide-semiconductor circuits, but further advances in ...

Berlin2023

Algèbre de Boole (logique)

Graph Chatbot

Chattez avec Graph Search

Scalable Logic Rewriting Using Don’t Cares

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Succinct ordering and aggregation constraints in algebraic array theories

On algebraic array theories

Lattice packings through division algebras

Improving Standard-Cell Design Flow using Factored Form Optimization

Neuromorphic computing based on halide perovskites

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Scalable Logic Rewriting Using Don’t Cares

Lattice packings through division algebras

On algebraic array theories

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Succinct ordering and aggregation constraints in algebraic array theories

Neuromorphic computing based on halide perovskites

Improving Standard-Cell Design Flow using Factored Form Optimization