501 search results - page 18 / 101 » Communication Lower Bounds Using Dual Polynomials |
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
IPCO
2008
13 years 10 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
ACL
2011
13 years 12 days ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
ECCC
2011
13 years 3 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
WG
2005
Springer
14 years 2 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 ...