Patrick Posser (Stable Roommates Problem Stable Matching Problem)
Revision as of 12: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.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/chapter/10.1007%2F978-3-319-07046-9_2")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n)$ words
(https://link-springer-com.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/chapter/10.1007%2F978-3-319-07046-9_2