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

Studia Logica 78 (1-2):349-356 (2004)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2016-02-15

Downloads
4 (#1,604,214)

6 months
1 (#1,506,218)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references