Skip to main content
SpringerLink
Log in

Extending semilattices is hard

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract

We show that the semilattice extension problem raised by Arbib and Manes in [2] isNP-hard, implying that no simple solution is likely to be forthcoming.

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. A. V. Aho, J. E. Hopcroft andJ. D. Ullman,The design and analysis of computer algorithms, Addison-Wesley, Reading, Massachusetts, 1974.

    Google Scholar 

  2. M. Z. Arbib andE. G. Mánes,Extensions of semilattices, Am. Math. Monthly82 (1975) 744–746.

    Google Scholar 

  3. L. J. Stockmeyer,The set basis problem is NP-complete. IBM Research Report RC5431, Yorktown Heights, NY 10598, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM T. J. Watson Research Center, Yorktown Heights, New York, USA

    George Markowsky

Authors
  1. George Markowsky
    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

Markowsky, G. Extending semilattices is hard. Algebra Universalis 17, 406–407 (1983). https://doi.org/10.1007/BF01194547

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation