✦ LIBER ✦

Complexity of certain problems of searching for subsets of vectors and cluster analysis

✍ Scribed by A. V. Kel’manov; A. V. Pyatkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pseudopolynomial algorithms for certain

✍ A. V. Kel’manov; S. M. Romanchenko 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 121 KB

Certain problems of vector analysis

✍ L. V. Kapitanskii; K. I. Piletskas 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 973 KB

An approximation scheme for a problem of

✍ Shenmaier, V. V. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 470 KB

On the complexity of a search for a subs

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 142 KB

On the Complexity of Searching a Set of

✍ Hirschberg, D. S. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 408 KB

An approximation algorithm for solving a

✍ A. V. Kel’manov; S. M. Romanchenko 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 452 KB