Skip to search formSkip to main contentSkip to account menu

Numerical 3-dimensional matching

Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers , and , each containing elements, and… 
Wikipedia (opens in a new tab)

Search for papers about Numerical 3-dimensional matching

Search papers