NP-hard

Concept

A class of computational problems for which there is no known efficient algorithm to find the optimal solution.

Mentioned in 1 video

Videos Mentioning NP-hard

Stanford CS229 Machine Learning | Spring 2026 | Lecture 9: K-Means and GMM (non-EM)

Stanford CS229 Machine Learning | Spring 2026 | Lecture 9: K-Means and GMM (non-EM)

Stanford Online

A class of computational problems for which there is no known efficient algorithm to find the optimal solution.