16 search results - page 1 / 4 » Decidability and Computability of Certain Torsion-Free Abeli... |
NDJFL
2010
12 years 11 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...
QCQC
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
CIE
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
RTA
2009
Springer
13 years 11 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...
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...