Résumé : We will investigate the probability distribution on the set of Boolean functions in n variables if a Boolean function is generated by a large Boolean expression drawn uniformly at random from all expressions of the same size. We show that a precise quantitative relation between the probability of a function and its complexity which is defined as the minimal size of an expression representing the function.
| Dernière modification : Thursday 21 November 2024 |
|
Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr |