scientific article; zbMATH DE number 18644

MaRDI QIDQ3976049zbMATH OpenFDO

Authors Stephan Waack

Publication date 26 June 1992

zbMATH Keywords

algorithmsdepthwreath productsword problemparallel 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) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• scientific article; zbMATH DE number 4145340
• On the parallel complexity of linear groups
• Polynomial time conjugacy in wreath products and free solvable groups.
• Parallel poly-pushdown groups
• The Parallel Complexity of Abelian Permutation Group Problems

Cited in

(9)

• The Parallel Complexity of Abelian Permutation Group Problems
• Complexity, combinatorial group theory and the language of palutators
• Parallel algorithms for power circuits and the word problem of the Baumslag group
• On the parallel complexity of linear groups
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Parallel poly-pushdown groups
• 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\)
• scientific article; zbMATH DE number 4145340 (Why is no real title available?)

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 Q3976049)