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

Celý popis

Podrobná bibliografia

Vydané v:	Communications in algebra Ročník 51; číslo 2; s. 799 - 806
Hlavný autor:	Shpilrain, Vladimir
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Taylor & Francis 01.02.2023 Taylor & Francis Ltd
Predmet:	Algorithms Automorphisms average-case complexity Complexity Free group Whitehead problem
ISSN:	0092-7872, 1532-4125
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!