✦ LIBER ✦

Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets

✍ Scribed by M. Yu. Khachai

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial optimization problems rela

✍ Vl. D. Mazurov; M. Yu. Khachay; M. I. Poberii 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 439 KB

Computational complexity of combinatoria

✍ M. Yu. Khachai, M. I. Poberii 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 380 KB

Computational complexity of the minimum

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

A set of compact finite-difference appro

✍ L. K. Bieniasz 📂 Article 📅 2007 🏛 Springer Vienna 🌐 English ⚖ 130 KB

Mixed finite-element method for the impr

✍ M. V. Marchuk; M. M. Khom'yak 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 518 KB