309 search results - page 26 / 62 » Communication Complexity Lower Bounds by Polynomials |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
WG
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...