3-dimensional matching
0 sources
3-dimensional matching
Summary
3-dimensional matching is a computational problem[1]. It draws 70 Wikipedia views per month (computational_problem category, ranking #27 of 61).[2]
Key Facts
- 3-dimensional matching's instance of is recorded as computational problem[3].
- 3-dimensional matching's part of is recorded as Karp's 21 NP-complete problems[4].
- 3-dimensional matching's Freebase ID is recorded as /m/05q79w5[5].
- 3-dimensional matching's Microsoft Academic ID is recorded as 72545166[6].
- 3-dimensional matching's OpenAlex ID is recorded as C72545166[7].
- 3-dimensional matching's computational complexity is recorded as NP-complete[8].
Why It Matters
3-dimensional matching draws 70 Wikipedia views per month (computational_problem category, ranking #27 of 61).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[9]