Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57255181, #quickstatements; #temporary_batch_1706897434465 |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:38, 5 March 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