This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
April 1982
·
78 Reads
·
213 Citations
IEEE Transactions on Information Theory
A simple (combinatorial) special case of the generalized Lloyd-Max (or quantization) problem is shown to be nondeterministic polynomial (NP)-complete. {em A fortiori}, the general problem of communication theory, in its combinatorial forms, has at least that complexity.
... It has been shown that the clustering problem, in its combinatorial basis, is NPhard [1][2], that is no polynomial algorithm exists which can solve the problem in the optimal way. Therefore, heuristic algorithms have to be practically used which can only find suboptimal solutions by trying the minimization of the SSE function cost. ...
April 1982
IEEE Transactions on Information Theory
