Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90246-e / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071016718 / rank | |||
Normal rank | |||
Revision as of 10:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum bounded 3-dimensional matching is MAX SNP-complete |
scientific article |
Statements
Maximum bounded 3-dimensional matching is MAX SNP-complete (English)
0 references
1991
0 references
approximation
0 references
combinatorial problems
0 references
computational complexity
0 references
MAX SNP- complete problems
0 references
