Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem |
scientific article; zbMATH DE number 37946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem |
scientific article; zbMATH DE number 37946 |
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
0.8861375
0 references
0.88613737
0 references
0.8820622
0 references
0.8791771
0 references
0.87546265
0 references
0.8700814
0 references
0.8660301
0 references
0.86529136
0 references
0.86366606
0 references
