Random Boolean expressions

  • Gardy D
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees. Analytic tools give us a systematic way to prove the existence of probability distributions, the main challenge being the actual computation of the distributions. We finally consider the relations between the probability of a Boolean function and its complexity.

Cite

CITATION STYLE

APA

Gardy, D. (2005). Random Boolean expressions. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AF,...(Proceedings). https://doi.org/10.46298/dmtcs.3475

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free