scientific article

zbMath0498.03038MaRDI QIDQ3962990

Stephan Waack

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finitely presented groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) 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 (6)

On the parallel complexity of linear groups ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ On groups that have normal forms computable in logspace. ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ Logspace computations in graph products

This page was built for publication: