Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
From MaRDI portal
Publication:5405065
DOI10.1007/978-3-642-54423-1_41zbMath1351.68191OpenAlexW2150973624MaRDI QIDQ5405065
Cécile Mailler, Antoine Genitrini
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_41
probability distributionBoolean functionsatisfiabilityanalytic combinatoricsBoolean formulasrandom Boolean expressions
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) Boolean functions (06E30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items