The relation between tree size complexity and probability for Boolean functions generated by uniform random trees

DOI10.2298/AADM160715015DzbMath1461.05178arXiv1407.0501OpenAlexW2963070552MaRDI QIDQ5279893

Antoine Genitrini, Bernhard Gittenberger, Veronika Daxner, Cécile Mailler

Publication date: 19 July 2017

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.0501

zbMATH Keywords

probability distributionBoolean functionsanalytic combinatoricsrandom Boolean formulastree size complexity

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Boolean functions (06E30)

Related Items (1)

Enumerating lambda terms by weighted length of their de Bruijn representation

This page was built for publication: The relation between tree size complexity and probability for Boolean functions generated by uniform random trees