Computational complexity of problems in classification according to a relation matrix

zbMath0605.68028MaRDI QIDQ1083849

E. Eh. Sinitsyn, M. M. Gil'burd

Publication date: 1985

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

NP completeconnectivity functional

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Computational complexity of problems in classification according to a relation matrix