486 search results - page 10 / 98 » Improved upper bounds for 3-SAT |
TCS
2008
13 years 8 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
HASE
2007
IEEE
14 years 2 months ago
2007
IEEE
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
JCT
2007
13 years 8 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...