scientific article; zbMATH DE number 3784868

zbMATH Open0498.03038MaRDI QIDQ3962990FDOQ3962990

Authors: Stephan Waack 

Publication date: 1981

Title of this publication is not available (Why is that?)

zbMATH Keywords

finitely presented groups

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) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40)

Cited In (6)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962990)