The growing tree distribution on Boolean functions.

DOI10.1137/1.9781611973013.5zbMath1430.68033OpenAlexW3119213944MaRDI QIDQ5194690

Cécile Mailler, Daniéle Gardy, Brigitte Chauvin

Publication date: 16 September 2019

Published in: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973013.5

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Boolean functions (06E30) Data structures (68P05)

Related Items (4)

The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ 2-Xor revisited: satisfiability and probabilities of functions ⋮ Associative and commutative tree representations for Boolean functions ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection

This page was built for publication: The growing tree distribution on Boolean functions.