1

The Perfect Matching problem was "almost" derandomized in 2016 [1]: there is a deterministic algorithm requiring "only" quaispolynomial resources, namely $n^{\mathcal O(\log n)}$ for the bipartite case and $n^{\mathcal O(\log^2n)}$ for the general case (in 2017 [2]). Although Edmonds gave a polynomial-time algorithm for perfect matching, ...


Only top voted, non community-wiki answers of a minimum length are eligible