Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:21, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem |
scientific article |
Statements
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (English)
0 references
1 June 2017
0 references
generic case complexity
0 references
amenability
0 references
Schreier graph
0 references
HNN extension
0 references
amalgamated product
0 references
conjugacy problem
0 references