Skip to main content
SpringerLink
Log in

Reliable networks for boolean functions with small complexity

  • Submitted Papers
  • Conference paper
  • First Online:
Parcella '88 (Parcella 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 342))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Pippenger, N.: On networks of noisy gates. 26. Symposium on Foundation on Computer science, 21. — 23.10.1985, Portland, 30–38.

    Google Scholar 

  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. Savage, J.E.: The complexity of computing. Wiley-Interscience, New York, 1976.

    Google Scholar 

  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. Uhlig, D.: On reliable networks from unreliable gates. In: Lect. Notes in Comp. Science 269, Springer Verlag (1987).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Ingenieurhochschule Mittweida, Platz der DSF 17, 9250, Mittweida, DDR

    Dietmar Uhlig

Authors
  1. Dietmar Uhlig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Wolf Tamáas Legendi Udo Schendel

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uhlig, D. (1989). Reliable networks for boolean functions with small complexity. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_131

Download citation

  • DOI: https://doi.org/10.1007/3-540-50647-0_131

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50647-8

  • Online ISBN: 978-3-540-46062-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation