✦ LIBER ✦

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

✍ Scribed by R. M. Kolpakov; M. A. Posypkin; I. Kh. Sigal

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing a lower bound on the computat

✍ Georg Gati 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

A lower bound on the computational compl

✍ Eric Goles; Marcos Kiwi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Estimating the computational complexity

✍ R. M. Kolpakov; M. A. Posypkin 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 456 KB

A nonlinear lower bound on the practical

✍ Xaver Gubáš; Juraj Hromkovič; Juraj Waczulík 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 558 KB

A lower bound on the computation complex

✍ E. A. Okol’nishnikova 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 490 KB

Computational implementation of a combin

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 KB