scientific article; zbMATH DE number 3390666
From MaRDI portal
Publication:5659463
Cited in
(5)- Optimal bounds for the approximation of Boolean functions and some applications
- On the average-case complexity of underdetermined functions
- On the average-case complexity of Boolean functions under binomial distribution on their domains
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Incomparable integrals and approximate calculation of monotone Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659463)
