Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität

DOI10.1007/BF00263767zbMath0371.02019OpenAlexW1577560285MaRDI QIDQ1243274

Jürgen Avenhaus, Klaus Madlener

Publication date: 1977

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263767

Mathematics Subject Classification ID

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 (11)

On the parallel complexity of linear groups ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. ⋮ Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ Unnamed Item ⋮ Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems ⋮ Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen ⋮ Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups

This page was built for publication: Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität