532 search results - page 4 / 107 » Graphically abelian groups |
NDJFL
2010
14 years 4 months ago
2010
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
116
click to vote
MOC
1998
14 years 9 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
EJC
2008
14 years 9 months ago
2008
In 2004, Cs
TCC
2004
Springer
15 years 2 months ago
2004
Springer
We explore the notion of a pseudo-free group, first introduced by Hohenberger [Hoh03], and provide an alternative stronger definition. We show that if Z∗ n is a pseudo-free abe...