And/or tree probabilities of Boolean functions
From MaRDI portal
Recommendations
- And/Or Trees Revisited
- Some typical properties of large AND/OR Boolean formulas
- The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
- Some typical properties of large AND/OR Boolean formulas
- Associative and commutative tree representations for Boolean functions
Cited in
(23)- Enumerating lambda terms by weighted length of their de Bruijn representation
- No Shannon effect induced by and/or trees
- Asymptotic properties of combinatory logic
- A sprouting tree model for random boolean functions
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison
- Some typical properties of large AND/OR Boolean formulas
- Random Boolean expressions
- Tautologies over implication with negative literals
- scientific article; zbMATH DE number 718640 (Why is no real title available?)
- Some typical properties of large AND/OR Boolean formulas
- Equilibrium points of an AND-OR tree: under constraints on probability
- Analysis of Boolean variables using formal probability
- Moments of weights of random nonuniform Boolean functions
- Balanced and/or trees and linear threshold functions
- The growing tree distribution on Boolean functions.
- The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
- Probabilities of 2-Xor Functions
- Kazuyuki Tanaka's Work on AND-OR Trees and Subsequent Developments
- Stochastic Algorithms: Foundations and Applications
- A combinatorial method for the evaluation of probabilities of complex Boolean functions
- Tree-shellability of Boolean functions
- Fuzzy logics – quantitatively
- Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree
This page was built for publication: And/or tree probabilities of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485333)
