scientific article

zbMath0739.20010MaRDI QIDQ3976049

Stephan Waack

Publication date: 26 June 1992

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

zbMATH Keywords

algorithmswreath productsword problemdepthparallel complexityfinitely presented group\(HNN\)-extensions\(NC^ 1\)- equivalentfree and direct products

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)

This page was built for publication: