Skip to main content
SpringerLink
Log in

Characterization of all optimal networks for a simultaneous computation of AND and NOR

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We characterize the optimal networks for a simultaneous computation of AND and NOR over the base of all 16 Boolean operators. We show that the optimal networks for AND and NOR are precisely the networks that consist of a disjoint union of an optimal network for AND with an optimal network for NOR.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Paul, W.: A 2.5n lower bound on the combinatorial complexity of Boolean functions. SIAM J. Comput. 6, 427–443 (1977)

    Google Scholar 

  2. Paul, W.: Realizing Boolean functions on disjoint sets of variables. Theor. Comp. Sci. 2, 383–396 (1976)

    Google Scholar 

  3. Pippenger, N., Fischer, M.J.: Relation among complexity measures. JACM 26, 361–381 (1979)

    Google Scholar 

  4. Savage, J.E.: Computional work and time on finite machines. JACM 19, 660–674 (1972)

    Google Scholar 

  5. Schnorr, C.P.: The network complexity and the Turing machine complexity of finite functions. Acta Informat. 7, 95–107 (1976)

    Google Scholar 

  6. Schnorr, C.P.: The combinatorial complexity of equivalence. Theor. Comp. Sci. 1, 289–295 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10, Angewandte Mathematik und Informatik, Universität des Saarlandes, D-6600, Saarbrücken, Fed. Rep.

    Norbert Blum

  2. Fachbereich 12, Mathematik, Johann Wolfgang v. Goethe-Universität, D-6000, Frankfurt a.M., Fed. Rep.

    Martin Seysen

Authors
  1. Norbert Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Seysen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blum, N., Seysen, M. Characterization of all optimal networks for a simultaneous computation of AND and NOR. Acta Informatica 21, 171–181 (1984). https://doi.org/10.1007/BF00289238

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289238

Keywords

Search

Navigation