Skip to main content
SpringerLink
Log in

Maximal rectangular relations

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

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. Anderson, J.A., What is a distinctive feature? Tech. Report No. 74-1 from The Center for Neural Studies, Brown University, Providence, Rhode Island (1974).

    Google Scholar 

  2. Bednarek, A.R. and O.E. Taulbee, On maximal chains, Rev. Roum. Math. Pures App. XI (1966), 23–25.

    Google Scholar 

  3. Birkhoff, G., Lattice Theory, First ed., Colloquium publication XXXV, American Mathematical Society, Providence, 1948.

    Google Scholar 

  4. Brindley, G.S., Nerve net models of plausible size that perform many simple learning tasks, Proc. Royal Soc. London, B. 174 (1969), 173–191.

    Google Scholar 

  5. Cooper, L.N., A possible organization of animal memory and learning, Proceedings of the Nobel symposium on Collective Properties of Physical Systems, Aspenasgarden, Sweden — June 12–16, 1973.

    Google Scholar 

  6. Fay, G., An algorithm for finite galois connections, Technical Report from The Institute for Industrial Economy, Organization and Computation Technique, Budapest (1973).

    Google Scholar 

  7. Norris, Eugene M., An algorithm for computing the maximal rectangles in a binary relation, Technical Report No. 08A05-1, Department of Mathematics and Computer Science, University of South Carolina.

    Google Scholar 

  8. Norris, E.M., Computing the Maximal Rectangles Contained in a Binary Relation (submitted for publication).

    Google Scholar 

  9. Osteen, Robert E., Clique detection algorithms based on line addition and removal, SIAM J. Appl. Math. 26 (1974), 126–135.

    Google Scholar 

  10. Simpson, Robert J., The application of rectangular relations to the study of binary relations on a set, Ph.D. dissertation, University of Tennessee, 1972.

    Google Scholar 

  11. Szasz, Gabor, Introduction to Lattice Theory, Third edition, Academic Press, New York (1963).

    Google Scholar 

  12. Stevens, C.F., Neurophysiology: a Primer, Wiley, New York (1966).

    Google Scholar 

  13. Hebb, D.O. The Organization of Behavior, Wiley, New York, (1949).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of South Carolina, 29208, Columbia, SC, USA

    Eugene M. Norris

Authors
  1. Eugene M. Norris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Norris, E.M. (1977). Maximal rectangular relations. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation