146 search results - page 16 / 30 » The Complexity of Integer Bound Propagation |
SWAT
2010
Springer
14 years 7 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
69
Voted
TIT
2008
14 years 9 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
CONSTRAINTS
2007
14 years 9 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...