Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,396,263 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
3-partition problem
List of NP-complete problems
Search for papers about Numerical 3-dimensional matching
Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE