real algebraic geometry

New research explores computational hardness of continuous clustering problems

Researchers have investigated the computational complexity of clustering problems defined directly on continuous probability densities, assuming the density is represented by a polynomial. They analyzed four questions: …