A combinatorial method for the evaluation of probabilities of complex Boolean functions
From MaRDI portal
Publication:5932979
zbMATH Open0966.06017MaRDI QIDQ5932979
A. E. Gorodetskii, V. V. Dubarenko
Publication date: 24 June 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
evaluation of probabilities of Boolean functionspolynomial normal formrepresentation of Boolean functionsZhegalkin polynomials
Related Items (3)
Probabilities of 2-Xor Functions ⋮ О методах оценивания веса булевых биюнктивных функций ⋮ Probabilistic Aspects of Boolean Switching Functions via a New Transform
Recommendations
- Probabilities of Boolean functions given by random implicational formulas 👍 👎
- An analytic method in probabilistic combinatorics 👍 👎
- Complexity and Probability of Some Boolean Formulas 👍 👎
- Probabilistic Methods in Combinatorial Analysis 👍 👎
- Probabilistic estimation of the algebraic degree of Boolean functions 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: A combinatorial method for the evaluation of probabilities of complex Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932979)