@article{dmtcs:3355,
    title      = {And/or tree probabilities of Boolean functions},
    author     = {Danièle Gardy and Alan Woods},
    url        = {https://dmtcs.episciences.org/3355},
    doi        = {10.46298/dmtcs.3355},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
    issuetitle = {Proceedings},
    eid        = 4,
    year       = {2005},
    month      = {Jan},
    keywords   = {tree enumeration, tautology, And/Or tree, Boolean formula, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]},
    language   = {English},
}