The power word problem in graph products

DOI10.1007/s00224-024-10173-zMaRDI QIDQ6580077

Florian Stober, Markus Lohrey, Armin Weiß

Publication date: 29 July 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

nilpotent groupword problemright-angled Artin groupGrigorchuk groupfinite index subgroupcompressed word problempower word problem

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The power word problem in graph products