Hentenryck et. al. (Arc Consistency? Stable Matching Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{3})$? words
(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/000437029290020X)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1992
Reference
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/abs/pii/000437029290020X