On the mean evaluation of polynomially reducible Boolean functions
From MaRDI portal
Publication:5936693
zbMATH Open0964.94032MaRDI QIDQ5936693
Publication date: 4 July 2001
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Related Items (1)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Complexity of Boolean functions in the class of polarized polynomial forms 👍 👎
- Computational bound on complexity of polynomial representations of Boolean functions 👍 👎
- On the multiplicative complexity of some Boolean functions 👍 👎
- Complexity of Boolean functions in the class of canonical polarized polynomials 👍 👎
- Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ 👍 👎
- On the Multiplicative Complexity of Boolean Functions 👍 👎
- Complexity of Boolean functions in a class of canonical polarized polynomials 👍 👎
- Approximate evaluations of characteristic polynomials of Boolean functions 👍 👎
This page was built for publication: On the mean evaluation of polynomially reducible Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936693)
