Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs
Fiche du document
Date
2002
Discipline
Type de document
Périmètre
Langue
Identifiants
- handle: 10670/1.x1oku9
- ITA_2002__36_3_229_0
- oai:numdam.org:ITA_2002__36_3_229_0
- citation: RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, 36, no. 3 (2002) p 229-247
- eudml-item-id urn:eudml:doc:245172
- ZBL 1032.68081
- MR 1958241
Relations
Ce document est lié à :
0988-3754
Collection
Organisation
Sujets proches
Analysis (Mathematics)Citer ce document
Henrik Brosenne et al., « Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs », RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, ID : 10670/1.x1oku9
