Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q2819751 |
||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6631256 | |||||||||||||||
Property / title | |||||||||||||||
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem (English) | |||||||||||||||
Property / title: Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1346.20041 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1145/2755996.2756644 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
29 September 2016
| |||||||||||||||
Property / publication date: 29 September 2016 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68W30 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6631256 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
amalgamated products | |||||||||||||||
Property / zbMATH Keywords: amalgamated products / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
amenable graphs | |||||||||||||||
Property / zbMATH Keywords: amenable graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
HNN extensions | |||||||||||||||
Property / zbMATH Keywords: HNN extensions / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
Schreier graphs | |||||||||||||||
Property / zbMATH Keywords: Schreier graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
strongly generic algorithms | |||||||||||||||
Property / zbMATH Keywords: strongly generic algorithms / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
time complexities | |||||||||||||||
Property / zbMATH Keywords: time complexities / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2025957322 / rank | |||||||||||||||
Normal rank |
Revision as of 10:01, 6 May 2024
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