2766 search results - page 196 / 554 » Algorithms for trigonometric polynomials |
125
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
163
click to vote
COCO
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
127
click to vote
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
We study genus g hyperelliptic curves with reduced automorphism group A5 and give equations y2 = f(x) for such curves in both cases where f(x) is a decomposable polynomial in x2 or...
112
click to vote
DCG
2008
15 years 4 months ago
2008
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
130
Voted
ECCC
2007
15 years 4 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...