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