scientific article; zbMATH DE number 4047114
From MaRDI portal
Publication:3783567
[For the entire collection see Zbl 0633.00025.] Some observations on the effect of information flow to the width of branching programs are given. It is shown that almost all Boolean functions have minimal programs with a small information flow and, on the other hand, that for some concrete functions the information flow is rather complicated in all their minimal programs. For a related work see the author [Theor. Comput. Sci. 57, 113-129 (1988)].
Recommendations
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 Q3783567)