Perfect Matching for Regular Graphs is $AC^0$- Hard for the General Matching Problem

Authors:
Elias Dahlhaus;Marek Karpinski
Affiliations:
-;-
Venue:
Perfect Matching for Regular Graphs is $AC^0$- Hard for the General Matching Problem
Year:
1986

Citing 0
Cited 1

The matching problem for bipartite graphs with polynomially bounded permanents is in NC

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We shall prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is $AC^0$-equivalent with the general perfect matching problem for arbitrary graphs.