Definitions from Wiktionary (stable marriage problem)
▸ noun: (mathematics, economics, computer science) The problem of finding a stable matching between two equal-sized sets of elements, given an ordering of preferences for each element.
▸ Words similar to stable marriage problem
▸ Usage examples for stable marriage problem
▸ Idioms related to stable marriage problem
▸ Wikipedia articles (New!)
▸ Words that often appear near stable marriage problem
▸ Rhymes of stable marriage problem
▸ Invented words related to stable marriage problem
▸ noun: (mathematics, economics, computer science) The problem of finding a stable matching between two equal-sized sets of elements, given an ordering of preferences for each element.
Similar:
Gale-Shapley algorithm,
Prouhet-Tarry-Escott problem,
parity,
ordered pair,
axiom of pairing,
pancake sorting,
matching,
Zarankiewicz problem,
optimization problem,
partial ordering relation,
more...
▸ Words similar to stable marriage problem
▸ Usage examples for stable marriage problem
▸ Idioms related to stable marriage problem
▸ Wikipedia articles (New!)
▸ Words that often appear near stable marriage problem
▸ Rhymes of stable marriage problem
▸ Invented words related to stable marriage problem