✦ LIBER ✦

New upper bounds for neighbor searching

✍ Scribed by B. Chazelle; R. Cole; F.P. Preparata; C. Yap

Book ID: 114037775
Publisher: Elsevier Science
Year: 1986
Weight: 979 KB
Volume: 68
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80030-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Upper Bounds for Maximum Satisfiabil

New Upper Bounds for Maximum Satisfiability

✍ Rolf Niedermeier; Peter Rossmanith 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB

The unweighted Maximum Satisfiability problem MAXSAT is: Given a Boolean formula in conjunctive normal form, find a truth assignment that satisfies the largest number of clauses. This paper describes exact algorithms that provide new Ž< < upper bounds for MAXSAT. We prove that MAXSAT can be solved i

New Upper Bounds for Ramsey Numbers

✍ Y.R Huang; K.M Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

Upper bounds for covering arrays by tabu

Upper bounds for covering arrays by tabu search

✍ Kari J. Nurmela 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A t-covering array is a collection of k vectors in a discrete space with the property that, in any t coordinate positions, all combinations of the coordinate values occur at least once. Such arrays have applications, for example, in software testing and data compression. Covering arrays are sometime

New upper bounds ofn!

✍ Mansour Mahmoud, Mohammed A Alghamdi… 📂 Article 📅 2012 🏛 Hindawi Publishing Corporation 🌐 English ⚖ 153 KB

New Worst-Case Upper Bounds for SAT

✍ Edward A. Hirsch 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 153 KB

New Upper Bounds for Finite Bh Sequences

✍ Javier Cilleruelo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let F h (N) be the maximum number of elements that can be selected from the set [1, ..., N] such that all the sums a 1 + } } } +a h , a 1 } } } a h are different. We introduce new combinatorial and analytic ideas to prove new upper bounds for F h (N). In particular we prove Besides, our techniques