Efficient collection in infinite polycyclic groups

Volker Gebhardt

doi:10.1006/jsco.2002.0559

Efficient collection in infinite polycyclic groups

Volker Gebhardt

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

We present and analyse an algorithm for collection in polycyclic groups which has better complexity in terms of the exponents occurring in the collected words than previously used collection algorithms, and yields a much better performance especially for infinite polycyclic groups.

Original language	English
Pages (from-to)	213-228
Number of pages	16
Journal	Journal of Symbolic Computation
Volume	34
Issue number	3
DOIs	https://doi.org/10.1006/jsco.2002.0559
Publication status	Published - 2002

Access to Document

10.1006/jsco.2002.0559

Cite this

@article{9186bdd2b41f451ba02ef2d50724c87c,

title = "Efficient collection in infinite polycyclic groups",

abstract = "We present and analyse an algorithm for collection in polycyclic groups which has better complexity in terms of the exponents occurring in the collected words than previously used collection algorithms, and yields a much better performance especially for infinite polycyclic groups.",

author = "Volker Gebhardt",

year = "2002",

doi = "10.1006/jsco.2002.0559",

language = "English",

volume = "34",

pages = "213--228",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

publisher = "Academic Press",

number = "3",

}

TY - JOUR

T1 - Efficient collection in infinite polycyclic groups

AU - Gebhardt, Volker

PY - 2002

Y1 - 2002

N2 - We present and analyse an algorithm for collection in polycyclic groups which has better complexity in terms of the exponents occurring in the collected words than previously used collection algorithms, and yields a much better performance especially for infinite polycyclic groups.

AB - We present and analyse an algorithm for collection in polycyclic groups which has better complexity in terms of the exponents occurring in the collected words than previously used collection algorithms, and yields a much better performance especially for infinite polycyclic groups.

UR - https://hdl.handle.net/1959.7/uws:78640

U2 - 10.1006/jsco.2002.0559

DO - 10.1006/jsco.2002.0559

M3 - Article

SN - 0747-7171

VL - 34

SP - 213

EP - 228

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - 3

ER -

Efficient collection in infinite polycyclic groups

Abstract

Access to Document

Other files and links

Fingerprint

Cite this