Revision as of 19:09, 28 November 2007 edit Koczy (talk \| contribs) 382 edits m Game Theory project ← Previous edit		Revision as of 21:25, 11 February 2008 edit undo 128.175.226.103 (talk) No edit summary Next edit →
Line 39: What is the [[Computational complexity theory\|order of computation]] of this algorithm? Is it an optimal algorithm? -- [[User:Beland\|Beland]] 14:56, 12 June 2007 (UTC) :O(n*m) --[[Special:Contributions/128.175.226.103\|128.175.226.103]] ([[User talk:128.175.226.103\|talk]]) 21:25, 11 February 2008 (UTC) {{GameTheoryProject}}

Talk:Stable matching problem: Difference between revisions