Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of approximating the independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4744064 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Revision as of 10:56, 21 June 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
