501 search results - page 20 / 101 » Communication Lower Bounds Using Dual Polynomials |
APAL
2008
13 years 9 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
IJCAI
2007
13 years 10 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
CPM
2010
Springer
14 years 1 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...