✦ LIBER ✦

Computational complexity of the minimal committee problem and adjacent problems

✍ Scribed by M. Yu. Khachai

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of the minimum

✍ M. Yu. Khachai 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 194 KB

On the Computational Complexity of the M

✍ Mikhail Yu. Khachay 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 442 KB

The complexity of minimal satisfiability

✍ Lefteris M. Kirousis; Phokion G. Kolaitis 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 214 KB

The computational complexity of knot and

✍ Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 185 KB

Area-time complexity of the unconstraine

✍ B. Codenotti; P. Favati 📂 Article 📅 1986 🏛 Springer Milan 🌐 English ⚖ 303 KB

Computational and approximational comple

✍ M. Yu. Khachai 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 172 KB