Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem |
scientific article |
Statements
Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (English)
0 references
28 June 1992
0 references
parallel complexity
0 references
Peterson's theorem
0 references
perfect matching
0 references
0 references
