scientific article; zbMATH DE number 3317755
From MaRDI portal
Publication:5597528
zbMath0199.31201MaRDI QIDQ5597528
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras. ⋮ On the complexity of the identity problem for finitely defined groups ⋮ On the complexity of individual identity problems in semigroups