Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57255181, #quickstatements; #temporary_batch_1706897434465 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57255181 / rank | |||
Normal rank | |||
Revision as of 20:03, 2 February 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
