Abstract
AbstractWe consider the model of random Boolean expressions based on balanced binary trees with leaves, to which are randomly attributed one of Boolean variables or their negations. We prove that if for every it holds that then asymptotically with high probability the Boolean expression is either a tautology or an antitautology. Our methods are based on the study of a certain binary operation on the set of probability measures on for a finite set I.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.