Probabilities of Boolean Functions given by Random Implicational Formulas

Electronic Journal Of Combinatorics

Antoine Genitrini¹ 

关键词: Boolean functions;    Boolean formulas;    Implication;    Analytic combinatorics;    Complexity;    Shannon effect;    Logic;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We study the asymptotic relation between the probability and the complexity of Boolean functions in the implicational fragment which are generated by large random Boolean expressions involving variables and implication, as the number of variables tends to

【 授权许可】

Others