(computing theory) A problem of interprocess communication and synchronization where one process responds to requests from multiple other threads and sleeps when not doing so. In some cases this may lead to an undesirable state where components are waiting for each other despite being ready.

plural of sleeping barber problem

Synonym of starlight problem

plural of stable matching problem

Synonym of stable marriage problem

(US, humorous) Used to report that a (major) problem has occurred.

(mathematics) The problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k.