RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2008 Volume 358, Pages 5–22 (Mi znsl2142)

This article is cited 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.

UDC: 512.552

Received: 04.06.2007


 English version:
Journal of Mathematical Sciences (New York), 2009, 158:5, 605–614

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024