Perfect matchings in o(::::n:::: log ::::n::::) time in regular bipartite graphs

Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect matchings in o(::::n:::: log ::::n::::) time in regular bipartite graphs. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 39-46, ACM, 2010. [doi]

Abstract

Abstract is missing.