2924 search results - page 147 / 585 » Lower Bounds in Distributed Computing |
IPL
2007
15 years 20 days ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
93
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
107
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
103
Voted
CPC
1998
15 years 13 days ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
100
click to vote
PODC
1999
ACM
15 years 5 months ago
1999
ACM
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...