✦ LIBER ✦

A lower bound of 12n2 on linear search programs for the Knapsack problem

✍ Scribed by David Dobkin; Richard J. Lipton

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Lower Bound on the Minimal Length

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

An improved upper bound for the zero-one

✍ Heiner Müller-Merbach 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

A Lower Bound on the Number of Solutions

✍ L.A. Newberg; D. Naor 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On the lower bound of mazur for autocorr

✍ M. Sirugue; A. Verbeure 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 309 KB

On a lower bound for the instability ran

✍ H.H.E. Leipholz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 157 KB

A lower bound on the single-operation wo

✍ Norbert Blum; Henning Rochow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB