Sciweavers

62 search results - page 1 / 13
» Computable Ordered Abelian Groups and Fields
Sort
View
CIE
2010
Springer
13 years 10 months ago
Computable Ordered Abelian Groups and Fields
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...
Alexander G. Melnikov
BIRTHDAY
2006
Springer
14 years 1 months ago
Finitely Presented Abelian Lattice-Ordered Groups
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...
Andrew M. W. Glass, Françoise Point
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
14 years 2 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
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 ...
Michele Mosca, Artur Ekert
MOC
1998
88views more  MOC 1998»
13 years 9 months ago
A space efficient algorithm for group structure computation
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....
Edlyn Teske
DCC
2008
IEEE
14 years 9 months ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel