Skip to Main content Skip to Navigation
Journal articles

On Maximal QROBDD's of Boolean Functions

Abstract : 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).
Complete list of metadata
Contributor : Jean-Baptiste Yunès Connect in order to contact the contributor
Submitted on : Thursday, June 22, 2006 - 5:27:49 PM
Last modification on : Friday, November 19, 2021 - 6:06:03 PM


  • HAL Id : hal-00081326, version 1


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



Record views