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).
Type de document :
Article dans une revue
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2005, 39, pp.ITA0442
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00081326
Contributeur : Jean-Baptiste Yunès <>
Soumis le : jeudi 22 juin 2006 - 17:27:49
Dernière modification le : jeudi 15 novembre 2018 - 20:26:56

Identifiants

  • HAL Id : hal-00081326, version 1

Citation

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〉

Partager

Métriques

Consultations de la notice

141