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.
@article{DahlhausK92,
title = {Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem},
author = {Elias Dahlhaus and Marek Karpinski},
year = {1992},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DahlhausK92},
cites = {0},
citedby = {0},
journal = {J. Comput. Syst. Sci.},
volume = {44},
number = {1},
pages = {94-102},
}