71 search results - page 4 / 15 » Polynomial time quantum algorithm for the computation of the... |
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
STOC
2002
ACM
14 years 7 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, ...
PAMI
2010
13 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
ADG
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...