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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Communications in algebra Jg. 51; H. 2; S. 799 - 806
1. Verfasser:	Shpilrain, Vladimir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 01.02.2023 Taylor & Francis Ltd
Schlagworte:	Algorithms Automorphisms average-case complexity Complexity Free group Whitehead problem
ISSN:	0092-7872, 1532-4125
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!