Skip to main content

Replacement in monotone Boolean networks: An algebraic perspective

  • Session 3 Theory
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1984)

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

Abstract

Replacement rules have played an important role in the study of monotone boolean function complexity. In this paper, notions of replaceability and computational equivalence are formulated in an abstract algebraic setting, and examined in detail for finite distributive lattices — the appropriate algebraic context for monotone boolean functions. It is shown that when computing an element f of a finite distributive lattice D, the elements of D partition into classes of computationally equivalent elements, and define a quotient of D in which all intervals of the form [t∧f, t∨f] are boolean. This quotient is an abstract simplicial complex with respect to ordering by replaceability. Possible applications of computational equivalence in developing upper and lower bounds on monotone boolean function complexity are indicated, and new directions of research, both abstract mathematical and computational, are suggested.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Beynon, W.M. Replaceability and computational equivalence in finite distributive lattices. Theory of Computation Report 61, Univ. of Warwick, 1984.

    Google Scholar 

  2. Beynon, W.M. Geometric aspects of partially-ordered systems, Ph.D. thesis, King's College, Univ. of London, 1973.

    Google Scholar 

  3. Beynon, W.M. Duality theorems for finitely-generated vector lattices, Proc.Lond.Math.Soc. (3) 31, 114–128, 1975.

    Google Scholar 

  4. Beynon, W.M. Vector lattices freely generated by distributive lattices, Math.Proc.Camb.Phil.Soc. (81), 193–220, 1977.

    Google Scholar 

  5. Beynon, W.M. & Buckle, J.F. Computational equivalence and replaceability in commutative semigroups. in preparation

    Google Scholar 

  6. Birkhoff, G.A. Lattice Theory, 3rd ed. AMS Colloquium Publications, Vol.XXV, 1967.

    Google Scholar 

  7. Dunne, P.E. A 2.5n lower bound on the monotone network complexity of T n3 , Theory of Computation Report 62, Univ. of Warwick, 1984.

    Google Scholar 

  8. Dunne, P.E. Some results on replacement rules in monotone boolean networks, Theory of Computation Report 64, Univ. of Warwick, 1984.

    Google Scholar 

  9. Grätzer, G. Lattice Theory: first concepts and distributive lattices, W.H.Freeman and Co., San Francisco, 1971.

    Google Scholar 

  10. Mehlhorn, K. & Galil, Z. Monotone switching networks and boolean matrix product, Computing (16), 99–111, 1976.

    Google Scholar 

  11. Paterson, M.S. Complexity of monotone networks for boolean matrix product, Theoretical Computer Science (1), 13–20, 1975.

    Google Scholar 

  12. Wegener, I On the complexity of slice-functions, Internal Report, Univ. Of Frankfurt, July 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mathai Joseph Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beynon, M. (1984). Replacement in monotone Boolean networks: An algebraic perspective. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-13883-8_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13883-9

  • Online ISBN: 978-3-540-39087-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics