|
Zapiski Nauchnykh Seminarov POMI, 2008, Volume 358, Pages 5–22
(Mi znsl2142)
|
|
|
|
This article is cited in 14 scientific papers (total in 14 papers)
Complexity of the identity checking problem for finite semigroups
J. Almeidaa, M. V. Volkovb, S. V. Gol'dbergb a University of Porto
b Ural State University
Abstract:
We prove that the identity checking problem in a finite semigroup $S$ is co-NP-complete whenever $S$ has a nonsolvable subgroup or $S$ is the semigroup of all transformations on a 3-element set. Bibl. – 31 titles.
Received: 04.06.2007
Citation:
J. Almeida, M. V. Volkov, S. V. Gol'dberg, “Complexity of the identity checking problem for finite semigroups”, Studies in constructive mathematics and mathematical logic. Part XI, Zap. Nauchn. Sem. POMI, 358, POMI, St. Petersburg, 2008, 5–22; J. Math. Sci. (N. Y.), 158:5 (2009), 605–614
Linking options:
https://www.mathnet.ru/eng/znsl2142 https://www.mathnet.ru/eng/znsl/v358/p5
|
Statistics & downloads: |
Abstract page: | 410 | Full-text PDF : | 135 | References: | 78 |
|