wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

3_dimensional_matching (453B)

      1 # 3DM
      2 
      3 https://en.wikipedia.org/wiki/3-dimensional_matching
      4 
      5 Problem: given 3 sets X, Y, Z of n elements, and triples T subseteq X times Y times Z,
      6 can you take a subset of T containing exactly once each element of X Y Z?
      7 
      8 [3_dimensional_matching_hardness_proof]
      9 
     10 Variant: [3_dimensional_matching_numerical]
     11 
     12 Generalization: https://en.m.wikipedia.org/wiki/Matching_in_hypergraphs
     13 
     14 Up: [computational_problem]
     15 
     16 See also: [perfect_matching], [dimension]