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

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

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1007/s11225-005-0356-5
Final published version

M. V. Volkov

Original language	English
Pages (from-to)	349-356
Number of pages	8
Journal	Studia Logica
Volume	78
Issue number	1-2
DOIs	https://doi.org/10.1007/s11225-005-0356-5
Publication status	Published - 1 Jan 2004

Research areas

Identity, NP-completeness, Quasi-identity, Semigroup

ASJC Scopus subject areas

Logic
History and Philosophy of Science

ID: 7883085