| author: | Danièle Gardy and Alan Woods |
|---|---|
| title: | And/or tree probabilities of Boolean functions |
| keywords: | And/Or tree, Boolean formula, tautology, tree enumeration |
| abstract: | We consider two probability distributions on Boolean functions defined in terms of their representations by and/or trees (or formulas). The relationships between them, and connections with the complexity of the function, are studied. New and improved bounds on these probabilities are given for a wide class of functions, with special attention being paid to the constant function True and read-once functions in a fixed number of variables. |
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Danièle Gardy and Alan Woods (2005), And/or tree probabilities of Boolean functions, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 139-146 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAD0113.ps.gz (84 K) |
| ps-source: | dmAD0113.ps (209 K) |
| pdf-source: | dmAD0113.pdf (112 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.