2766 search results - page 317 / 554 » Algorithms for trigonometric polynomials |
113
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
152
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
169
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
157
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
141
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...