Hentenryck et. al. (Arc Consistency? Stable Matching Problem)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{3})$? words (https://www.sciencedirect.com/science/article/abs/pii/000437029290020X) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1992 == Reference == https://www.sciencedirect.com/science/article/abs/pii/000437029290020X")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{3})$? words

(https://www.sciencedirect.com/science/article/abs/pii/000437029290020X)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1992

Reference

https://www.sciencedirect.com/science/article/abs/pii/000437029290020X

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hentenryck_et._al._(Arc_Consistency%3F_Stable_Matching_Problem)&oldid=44912"