Numerical 3-dimensional matching
id:
numerical-3-dimensional-matching-309-11324693
title:
Numerical 3-dimensional matching
text:
Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers X , Y and Z , each containing k elements, and a bound b . The goal is to select a subset M of X × Y × Z such that every integer in X , Y and Z occurs exactly once and that for every triple in the subset x + y + z = b holds.
This problem is labeled as [SP16] in.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Numerical_3-dimensional_matching
date created:
date modified:
2024-04-23T00:40:02Z
main entity:
{"identifier":"Q7069651","url":"https://www.wikidata.org/entity/Q7069651"}
image:
fields total:
13
integrity:
13