15 search results - page 2 / 3 » Fast quantum algorithms for computing the unit group and cla... |
ANTS
2006
Springer
13 years 9 months ago
2006
Springer
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
ANTS
2008
Springer
13 years 7 months ago
2008
Springer
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
SIAMCOMP
2010
13 years 3 months ago
2010
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
ICCV
2009
IEEE
13 years 3 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...