Identity checking problem for transformation monoids
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F12%3A00057566" target="_blank" >RIV/00216224:14310/12:00057566 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00233-012-9401-7" target="_blank" >http://dx.doi.org/10.1007/s00233-012-9401-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00233-012-9401-7" target="_blank" >10.1007/s00233-012-9401-7</a>
Alternative languages
Result language
angličtina
Original language name
Identity checking problem for transformation monoids
Original language description
We study the computational complexity of checking identities in a fixed finite monoid. We prove that this problem is coNP-complete for the monoid of all full transformations of a 4-element set. This result completes the description of the complexity of checking identities in the transformation monoids.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Semigroup Forum
ISSN
0037-1912
e-ISSN
—
Volume of the periodical
84
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
487-498
UT code for WoS article
000306590200005
EID of the result in the Scopus database
—