Complexity and Probability of Some Boolean Formulas
From MaRDI portal
Recommendations
Cited in
(16)- Bent functions and random Boolean formulas
- Formula Complexity of Ternary Majorities
- Oblivious bounds on the probability of boolean functions
- No Shannon effect on probability distributions on Boolean functions induced by random expressions
- Some typical properties of large AND/OR Boolean formulas
- Random Boolean expressions
- Complexity and Limiting Ratio of Boolean Functions over Implication
- scientific article; zbMATH DE number 176875 (Why is no real title available?)
- Probabilities of Boolean functions given by random implicational formulas
- Some typical properties of large AND/OR Boolean formulas
- The number of Boolean functions computed by formulas of a given size
- Improved boolean formulas for the Ramsey graphs
- On the complexity of computing a random Boolean function over the reals
- The Boolean functions computed by random Boolean formulas or how to grow the right function
- A combinatorial method for the evaluation of probabilities of complex Boolean functions
- Formulas for approximating pseudo-Boolean random variables
This page was built for publication: Complexity and Probability of Some Boolean Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238174)
