✦ LIBER ✦

Automatic solution of a certain class of combinatorial problems

✍ Scribed by Jacques Cohen; Joel Katcoff

Book ID: 113161912
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 468 KB
Volume: 6
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(77)90020-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Certain Combinatorial Problems

✍ Rosenstock, Herbert B. 📂 Article 📅 1962 🏛 American Institute of Physics 🌐 English ⚖ 351 KB

Solution of a certain class of nonlinear

Solution of a certain class of nonlinear two-point boundary value problems

✍ R.C Allen Jr.; G.M Wing; M Scott 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Solution of a certain class of covering

Solution of a certain class of covering problems by discrete optimization methods

✍ V. L. Kravets 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 676 KB

On the convex hull of feasible solutions

On the convex hull of feasible solutions to certain combinatorial problems

✍ Maurice Queyranne; Yaoguang Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 767 KB

A class of extremal combinatorial proble

A class of extremal combinatorial problems and their solution by the method of dichotomies

✍ S. A. Beletskii 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 565 KB

A combinatorial characterization of cert

A combinatorial characterization of certain universal classes of hash functions

✍ Tran van Trung 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

## Abstract A new lower bound on the size of ϵ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994