Patrick Posser (Stable Roommates Problem Stable Matching Problem)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n)$ words (https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n)$ words

(https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2014

Reference

https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Patrick_Posser_(Stable_Roommates_Problem_Stable_Matching_Problem)&oldid=45437"