Studia Logica

, Volume 78, Issue 1–2, pp 349–356 | Cite as

Checking quasi-identities in a finite semigroup may be computationally hard

  • M. V. Volkov
Article

Abstract

We exhibit a 10-element semigroup Q such that the question “Does a given quasi-identity hold inQ?” is co-NP-complete while the question “Does a given identity hold inQ?” can be answered in linear time.

Keywords

semigroup identity quasi-identity NP-completeness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bergman, C., and G. Slutzki, ‘Complexity of some problems concerning varieties and quasi-varieties of algebras’, SIAM J. Comput. 30:359–382, 2000.Google Scholar
  2. [2]
    Clifford, A. H., and G. B. Preston, The Algebraic Theory of Semigroups, Vol. I, Amer. Math. Soc., 1961.Google Scholar
  3. [3]
    Garey, M. R., and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.Google Scholar
  4. [4]
    Klíma, O., ‘Complexity issues of checking identities in finite monoids’, submitted.Google Scholar
  5. [5]
    Mashevitsky, G. I., ‘On identities in varieties of completely simple semigroups over abelian groups’, Modern Algebra, Leningrad, 81–89, 1978 (in Russian).Google Scholar
  6. [6]
    Ore, O., Theory of Graphs, Amer. Math. Soc., 1962.Google Scholar
  7. [7]
    Papadimitriou, C. H., Computational Complexity, Addison-Wesley Publishing Company, 1994.Google Scholar
  8. [8]
    Seif, S., ‘The Perkins semigroup has co-NP-complete term-equivalence problem’, submitted.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • M. V. Volkov
    • 1
  1. 1.Department of Mathematics and MechanicsUral State UniversityEkaterinburgRussua

Personalised recommendations