Sciweavers

3 search results - page 1 / 1
» A Nilpotent Quotient Algorithm for Certain Infinitely Presen...
Sort
View
IJAC
2008
116views more  IJAC 2008»
13 years 4 months ago
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
Laurent Bartholdi, Bettina Eick, René Hartu...
ICMS
2010
13 years 2 months ago
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
Bettina Eick, Max Horn
TCS
2008
13 years 4 months ago
Optimizing deletion cost for secure multicast key management
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...