Skip to main content
Log in

Ordering D-classes and computing Schein rank is hard

  • Short Note
  • Published:
Semigroup Forum Aims and scope Submit manuscript

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

Access this article

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

Instant access to the full article PDF.

References

  • [Br] Breen, Michael, “A Maximal Chain of Principal Ideals in the Semigroup of Binary Relations on a Finite Set”,Semigroup Forum, 43(1991), no. 1, 63–76.

    MATH  MathSciNet  Google Scholar 

  • [GJ] Garey, Michael R. and Johnson, David D.,Computers and Intractability, W. H. Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  • [Ki] Kim, Ki Hang,Boolean Matrix Theory and Applications, Marcel Dekker, New York and Basel, 1982.

    MATH  Google Scholar 

  • [Na] Nau, Dana S., “Specificity covering: immunological and other applications, computational complexity and other mathematical properties, and a computer program,” A.M. Thesis. Technical Report CS-1976-7, Computer Scicence Department, Duke University, Durham, NC, 1976.

    Google Scholar 

  • [St] Stockmeyer, Larry J., “The Set Basis Problem isNP-Complete”, Research Report No. RC-5431, IBM Thomas J. Watson Research Center, Yorktown Heights NY, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by B. M. Schein

Rights and permissions

Reprints and permissions

About this article

Cite this article

Markowsky, G. Ordering D-classes and computing Schein rank is hard. Semigroup Forum 44, 373–375 (1992). https://doi.org/10.1007/BF02574357

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Navigation