26 search results - page 5 / 6 » Superpolynomial Lower Bounds for Monotone Span Programs |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
WDAG
1990
Springer
13 years 11 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
TON
1998
13 years 7 months ago
1998
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...