Polynomial time conjugacy in wreath products and free solvable groups.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1242.20038
author: Svetla Vassileva
publication date: 2012-05-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/1011.5931
Mathematics Subject Classification ID: 20F16
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20E22
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6031530
zbMATH Keywords: free solvable groups
zbMATH Keywords: wreath products
zbMATH Keywords: conjugacy problem
zbMATH Keywords: complexity
zbMATH Keywords: conjugacy search problem
MaRDI profile type: Publication
OpenAlex ID: W1981151457
arXiv ID: 1011.5931
cites work: Conjugacy in Nilpotent Groups
cites work: THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
cites work: Small cancellation theory and automatic groups. II
cites work: An example of a finitely presented amenable group not belonging to the classEG
cites work: SOLVING THE WORD PROBLEM IN REAL TIME
cites work: Conjugacy in polycyclic groups
DOI: 10.1515/GCC.2011.005
title: Polynomial time conjugacy in wreath products and free solvable groups.
published in: Groups, Complexity, Cryptology
description: scientific article; zbMATH DE number 6031530