✦ LIBER ✦

Complexity Bounds on General Hard-Core Predicates

✍ Scribed by Mikael Goldmann; Mats Näslund; Alexander Russell

Publisher: Springer
Year: 2001
Tongue: English
Weight: 153 KB
Volume: 14
Category: Article
ISSN: 0933-2790
DOI: 10.1007/s00145-001-0007-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bound on the condensate in the har

Upper bound on the condensate in the hard-core Bose lattice gas

✍ Bálint Tóth 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 173 KB

Gibbs processes and generalized Bernoull

Gibbs processes and generalized Bernoulli flows for hard-core one-dimensional systems

✍ G. Caldiera; E. Presutti 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 381 KB

On the complexity of test case generatio

On the complexity of test case generation for NP-hard problems

✍ Laura A. Sanchis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 562 KB

A lower bound on the size of a complex g

A lower bound on the size of a complex generated by an antichain

✍ P. Frankl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.