Stochastic approximation of Boolean functions
From MaRDI portal
In this paper the author describes maximal extensions of some Post classes in the algebra of random Boolean functions. As a natural continuation of the author's preceding results, this study is related to the general problem of approximative stochastic implementation of Boolean functions over a finite basis of random Boolean functions. The expectations of the random functions in the basis are assumed to be known.
Recommendations
Cited in
(9)- Boolean averaging in a statistical mechanics model and in an analog-to-digital converter
- Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n
- О методах оценивания веса булевых биюнктивных функций
- Probabilistic Aspects of Boolean Switching Functions via a New Transform
- scientific article; zbMATH DE number 5022109 (Why is no real title available?)
- Minimizability of random Boolean functions
- A New Algorithm for Complex Stochastic Boolean Systems
- scientific article; zbMATH DE number 2208579 (Why is no real title available?)
- Formulas for approximating pseudo-Boolean random variables
This page was built for publication: Stochastic approximation of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395339)