activity
20202024
most citedCayley Polynomial-Time Computable Groups

2 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

math.GR2020★ 2 cited

Cayley Polynomial-Time Computable Groups

Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We…

math.GR2020★ 2 cited

Nonstandard Cayley automatic representations of fundamental groups

Dmitry Berdinsky, Prohrak Kruengthomya

We construct a new family of Cayley automatic representations of semidirect products for which none of the projections of the normal subgroup $\…