290 search results - page 39 / 58 » Pseudorandom Bits for Polynomials |
TWC
2008
13 years 8 months ago
2008
Broadcasting allows efficient information sharing and fusion in wireless networks. In this paper, the energy efficiency limits in wireless broadcasting, defined as the minimal achi...
CASC
2009
Springer
14 years 3 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
COMPGEOM
1989
ACM
14 years 16 days ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
FOCM
2008
13 years 8 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...