✦ LIBER ✦

The Shannon function of the complexity of interval search on the Boolean cube in the class of trees

✍ Scribed by Blaivas, T. D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The asymptotic behaviour of the complexi

✍ Blaivas, T. D. 📂 Article 📅 2004 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 100 KB

The number of spanning trees of the gene

✍ T.-C. Huang; J.-F. Wang; C.-S. Yang; J.-Y. Lee 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 450 KB

On the weak isometries of the Boolean cu

✍ V. Yu. Krasin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 400 KB

Complexity of Boolean functions in the c

✍ N. A. Peryazev 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 149 KB

The Complexity of Boolean Constraint Sat

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 124 KB

The complexity of Boolean constraint sat

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 129 KB