Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(92)90005-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964011448 / rank | |||
Normal rank | |||
Revision as of 19:46, 19 March 2024
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
