Elias Dahlhaus, Marek Karpinski. Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci., 44(1):94-102, 1992.
No references recorded for this publication.
No citations of this publication recorded.