231 search results - page 17 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
JSC
2011
13 years 2 months ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
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, ...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Existing Full-wave Model Order Reduction (FMOR) approaches are based on Expanded Taylor Series Approximations (ETAS) of the oscillatory full-wave system matrix. The accuracy of su...