Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem

Volker Diekert, Alexei G. Myasnikov, Armin Weiß

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Fingerprint

Dive into the research topics of 'Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem'. Together they form a unique fingerprint.

Mathematics

Computer Science