Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem (Q2819751)
From MaRDI portal
Item:Q2819751
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
29 September 2016
0 references
amalgamated products
0 references
amenable graphs
0 references
conjugacy problem
0 references
generic case complexity
0 references
HNN extensions
0 references
Schreier graphs
0 references
strongly generic algorithms
0 references
time complexities
0 references
