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 in Q? is co-NP-complete while the question Does a given identity hold in Q? can be answered in linear time.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
44 (#498,365)

6 months
16 (#178,571)

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