Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
From MaRDI portal
Publication:1243275
DOI10.1007/BF00289077zbMath0371.02020OpenAlexW2614477779MaRDI QIDQ1243275
Klaus Madlener, Jürgen Avenhaus
Publication date: 1978
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289077
Analysis of algorithms and problem complexity (68Q25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)
Related Items (8)
Restrictions of congruences generated by finite canonical string-rewriting systems ⋮ On the parallel complexity of linear groups ⋮ FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY ⋮ Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups ⋮ Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem ⋮ The Nielsen reduction and P-complete problems in free groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
Cites Work
This page was built for publication: Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen