Abstract
We prove that in any computation by logical operations of a Boolean function f which merges information of size 2n (for instance ) there exist at least n node-disjoint pairs of merging paths. Given a directed acyclic graph with max indegree 2 then the size of any cut which breaks all pairs of merging paths is a lower bound for the twofold maximal size of any set of node-disjoint pairs of merging paths. These lower bounds for the number of node-disjoint pairs of merging paths cannot be improved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P. (1974). On Maximal Merging of Information in Boolean Computations. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive