Advertisement

On Maximal Merging of Information in Boolean Computations

  • C. P. Schnorr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

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.

Keywords

Boolean Function Directed Acyclic Graph Turing Machine Logical Operation Labelling Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • C. P. Schnorr
    • 1
  1. 1.Fachbereich MathematikUniversität FrankfurtDeutschland

Personalised recommendations