On Maximal QROBDD's of Boolean Functions

Jean-Baptiste Yunès (1) , Jean-Francis Michon (2) , Pierre Valarcher (3)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LIFAR - Laboratoire d'informatique fondamentale et appliquée de Rouen
3 LACL - Laboratoire d'Algorithmique Complexité et Logique

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

Mots clés: Boolean Functions; Complexity; Binary Decision Diagram

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]; Combinatoire [math.CO]

Jean-Baptiste Yunès, Jean-Francis Michon, Pierre Valarcher. On Maximal QROBDD's of Boolean Functions. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2005, 39, pp.ITA0442. ⟨hal-00081326⟩