Cite
HARVARD Citation
Diekert, V. et al. (2017). Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. Journal of symbolic computation. pp. 147-165. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Diekert, V. et al. (2017). Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. Journal of symbolic computation. pp. 147-165. [Online].