Subgroup Membership in GL(2,Z)

It is shown that the subgroup membership problem for a virtually free group can be decided in polynomial time when all group elements are represented by so-called power words, i.e., words of the form p 1 z 1 p 2 z 2 ⋯ p k z k . Here the p i are explicit words over the generating set of the group and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2024-08, Vol.68 (4), p.1082-1107
1. Verfasser:	Lohrey, Markus
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Coding Computer Science Integers Numbers Polynomials Subgroups Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!