Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02193177n
Noun Concept
Categories: NP-complete problems, Theoretical computer science
EN
exact cover  exact cover problem  exact hitting set
EN
In the mathematical field of combinatorics, given a collection S of subsets of a set X, an exact cover is a subcollection S* of S such that each element in X is contained in exactly one subset in S*. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of combinatorics, given a collection S of subsets of a set X, an exact cover is a subcollection S* of S such that each element in X is contained in exactly one subset in S*. Wikipedia
A disjoint family of sets, drawn from a larger collection, with the same union as the whole collection Wikidata
IS A
constraint satisfaction problem
computational problem
cover
PART OF
Karp's 21 NP-complete problems
Wikipedia
EN
exact cover
Wikidata
EN
exact cover
Wikipedia Redirections
EN
Exact Cover, exact cover problem, exact hitting set

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License