2766 search results - page 358 / 554 » Algorithms for trigonometric polynomials |
141
click to vote
ANSS
2005
IEEE
15 years 10 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
122
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
112
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
156
click to vote
EUROCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
141
click to vote
PCI
2005
Springer
15 years 10 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...