Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315)
From MaRDI portal
scientific article; zbMATH DE number 6631256
- Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem |
scientific article; zbMATH DE number 6631256 |
|
Statements
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (English)
0 references
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem (English)
0 references
1 June 2017
0 references
29 September 2016
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
amalgamated products
0 references
amenable graphs
0 references
HNN extensions
0 references
Schreier graphs
0 references
strongly generic algorithms
0 references
time complexities
0 references
0 references
0 references
0 references
0 references
