✦ LIBER ✦

On the complexity of some cluster analysis problems

✍ Scribed by A. V. Kel’manov

Book ID: 110196504
Publisher: SP MAIK Nauka/Interperiodica
Year: 2011
Tongue: English
Weight: 290 KB
Volume: 51
Category: Article
ISSN: 0965-5425
DOI: 10.1134/s0965542511110108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of some data analysis

On the complexity of some data analysis problems

✍ A. V. Kel’manov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 236 KB

On the complexity of some coding problem

On the complexity of some coding problems (Corresp.)

✍ Ntafos, S.; Hakimi, S. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 546 KB

On the algorithmic complexity of a probl

On the algorithmic complexity of a problem in cluster analysis

✍ A. V. Dolgushev; A. V. Kel’manov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 440 KB

Complexity of some problems concerningLs

Complexity of some problems concerningLsystems

✍ Neil D. Jones; Sven Skyum 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 960 KB

On the Complexity of Some Enumeration Pr

On the Complexity of Some Enumeration Problems for Matroids

✍ Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 258 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB