Average-case complexity of the Whitehead problem for free groups

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that sol...

Full description

Bibliographic Details

Published in:	Communications in algebra Vol. 51; no. 2; pp. 799 - 806
Main Author:	Shpilrain, Vladimir
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 01.02.2023 Taylor & Francis Ltd
Subjects:	Algorithms Automorphisms average-case complexity Complexity Free group Whitehead problem
ISSN:	0092-7872, 1532-4125
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!