Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On maximal QROBDD’s of boolean functions

Jean-Francis Michon;  Jean-Baptiste Yunès;  Pierre Valarcher — 2005

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).

On maximal QROBDD's of Boolean functions

Jean-Francis Michon;  Jean-Baptiste Yunès;  Pierre Valarcher — 2010

RAIRO - Theoretical Informatics and Applications

We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).

Page 1

Download Results (CSV)