Reliable networks for boolean functions with small complexity

  • Dietmar Uhlig
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 342)


We show that there are Boolean functions with linear (combinatorial) complexity for which there are reliable networks 1) having almost the same small complexity as the unreliable networks and 2) having, nethertheles, a very small error probability.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Neumann von, J.: Probabilistic logic of reliable organism from unreliable components. In: C. E. Shannon and J. Mc Carthy (Eds.), Automata studies, Princeton University Press (1956) 43–98.Google Scholar
  2. [2]
    Pippenger, N.: On networks of noisy gates. 26. Symposium on Foundation on Computer science, 21. — 23.10.1985, Portland, 30–38.Google Scholar
  3. [3]
    Lupanov, O.B.: On a method of synthesis of networks. Izv. Vyss. Ucebn. Zaved. Radiofizika 1 (1958) 1, 120–140. (Russian)Google Scholar
  4. [4]
    Savage, J.E.: The complexity of computing. Wiley-Interscience, New York, 1976.Google Scholar
  5. [5]
    Dobrushin, R.L. and S.I. Ortyukov: On the lower bound for redundancy of self-correcting networks of unreliable functional elements. Prob. Peredaci Informacii 13 (1977) 1, 82–89. (Russ.)Google Scholar
  6. [6]
    Uhlig, D.: On reliable networks from unreliable gates. In: Lect. Notes in Comp. Science 269, Springer Verlag (1987).Google Scholar
  7. [7]
    Uhlig, D.: On reliable networks from unreliable gates with almost minimal complexity. In: Lect. Notes in Comp. Science, Springer Verlag, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Dietmar Uhlig
    • 1
  1. 1.Ingenieurhochschule MittweidaMittweidaDDR

Personalised recommendations