13306 search results - page 314 / 2662 » Theoretical Computer Science |
158
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whethe...
178
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
176
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
163
Voted
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
157
Voted
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...