✦ LIBER ✦

Performance bounds for binary testing with arbitrary weights

✍ Scribed by Donald W. Loveland

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 686 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00290148

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance bounds on the splitting algo

Performance bounds on the splitting algorithm for binary testing

✍ M. R. Garey; R. L. Graham 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 407 KB

Exact Bounds for orthogonal polynomials

Exact Bounds for orthogonal polynomials associated with exponential weights

✍ Paul Nevai 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 184 KB

On Nevai's bounds for orthogonal polynom

On Nevai's bounds for orthogonal polynomials associated with exponential weights

✍ D.S Lubinsky 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Boolean constraint satisfaction: complex

Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights

✍ Peter Jonsson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

A boolean constraint satisfaction problem consists of some ÿnite set of constraints (i.e., functions from 0=1-vectors to {0; 1}) and an instance of such a problem is a set of constraints applied to speciÿed subsets of n boolean variables. The goal is to ÿnd an assignment to the variables which satis

The nucleolus for cooperative games with

The nucleolus for cooperative games with arbitrary bounds of individual rationality

✍ Arkady Sobolev 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 381 KB

Test sets for morphisms with bounded del

Test sets for morphisms with bounded delay

✍ Christian Choffrut; Juhani Karhumäki 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 390 KB