Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q260110
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem
description / endescription / en
scientific article
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 / author
 
Property / author: Alexei G. Myasnikov / 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
Timestamp+2016-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2553053200 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025957322 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.05579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbit decidability and the conjugacy problem for some extensions of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenability and paradoxical decompositions for pseudogroups and for discrete metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cogrowth and amenability of discrete groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic rewriting systems and pregroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic rewriting and conjugacy problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in Baumslag's group, generic case complexity, and division in power circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On groups with full Banach mean value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs with a strong isoperimetric property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authentication from Matrix Conjugation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Word Problem and Related Results for Graph Product Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Banach Mean Values on Countable groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Random Walks on Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on weakly hyperbolic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Group-Theoretic Decision Problems and Their Classification. (AM-68) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4891336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic complexity of undecidable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cogrowth of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory and public key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential theory on infinite networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5651924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks on Infinite Graphs and Groups / rank
 
Normal rank

Latest revision as of 21:31, 13 July 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
  • Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem

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
0 references
0 references
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
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references