collaborators

1 paper

math.GR2019

Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems

Laurent Bartholdi, Michael Figelius, Markus Lohrey +1

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, G…