Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Numerical_3-dimensional_matching> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Numerical_3-dimensional_matching abstract "Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers , and , each containing elements, and a bound . The goal is to select a subset of such that every integer in , and occurs exactly once and that for every triple in the subset holds.This problem is labeled as [SP16] in.".
- Numerical_3-dimensional_matching wikiPageID "33535571".
- Numerical_3-dimensional_matching wikiPageRevisionID "544423642".
- Numerical_3-dimensional_matching hasPhotoCollection Numerical_3-dimensional_matching.
- Numerical_3-dimensional_matching subject Category:Strongly_NP-complete_problems.
- Numerical_3-dimensional_matching comment "Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers , and , each containing elements, and a bound . The goal is to select a subset of such that every integer in , and occurs exactly once and that for every triple in the subset holds.This problem is labeled as [SP16] in.".
- Numerical_3-dimensional_matching label "Numerical 3-dimensional matching".
- Numerical_3-dimensional_matching sameAs m.0hgp8s8.
- Numerical_3-dimensional_matching sameAs Q7069651.
- Numerical_3-dimensional_matching sameAs Q7069651.
- Numerical_3-dimensional_matching wasDerivedFrom Numerical_3-dimensional_matching?oldid=544423642.
- Numerical_3-dimensional_matching isPrimaryTopicOf Numerical_3-dimensional_matching.