63 search results - page 11 / 13 » Isomorphisms of Algebraic Number Fields |
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, ...
FSE
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
ALGORITHMICA
2002
13 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
PAMI
2010
13 years 5 months ago
2010
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
CASES
2005
ACM
13 years 9 months ago
2005
ACM
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...