Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q260110 |
||
| Property / author | |||
| Property / author: Q483665 / rank | |||
Revision as of 05:03, 12 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
