The Matching Problem in General Graphs is in Quasi-NC

Ola Svensson, Jakub Tarnawski. The Matching Problem in General Graphs is in Quasi-NC. Electronic Colloquium on Computational Complexity (ECCC), 24:59, 2017. [doi]

Abstract

Abstract is missing.