# And/or tree probabilities of Boolean functions

Abstract : We consider two probability distributions on Boolean functions defined in terms of their representations by $\texttt{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 $\textit{True}$ and read-once functions in a fixed number of variables.
Keywords :
Type de document :
Communication dans un congrès
Conrado Martínez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.139-146, 2005, DMTCS Proceedings
Domaine :

Littérature citée [11 références]

https://hal.inria.fr/hal-01184027
Contributeur : Coordination Episciences Iam <>
Soumis le : mercredi 12 août 2015 - 15:51:30
Dernière modification le : jeudi 11 janvier 2018 - 06:21:31
Document(s) archivé(s) le : vendredi 13 novembre 2015 - 11:39:58

### Fichier

Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184027, version 1

### Citation

Danièle Gardy, Alan Woods. And/or tree probabilities of Boolean functions. Conrado Martínez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.139-146, 2005, DMTCS Proceedings. 〈hal-01184027〉

### Métriques

Consultations de la notice

## 145

Téléchargements de fichiers