Exact cover
In mathematics, given a collection of subsets of a set X, an exact cover is a subcollection of such that each element in X is contained in exactly one subset in .One says that each element in X is covered by exactly one subset in .An exact cover is a kind of cover. In computer science, the exact cover problem is a decision problem to determine if an exact cover exists.The exact cover problem is NP-completeand is one of Karp's 21 NP-complete problems.The exact cover problem is a kind of constraint satisfaction problem.
Wikipage redirect
primaryTopic
Exact cover
In mathematics, given a collection of subsets of a set X, an exact cover is a subcollection of such that each element in X is contained in exactly one subset in .One says that each element in X is covered by exactly one subset in .An exact cover is a kind of cover. In computer science, the exact cover problem is a decision problem to determine if an exact cover exists.The exact cover problem is NP-completeand is one of Karp's 21 NP-complete problems.The exact cover problem is a kind of constraint satisfaction problem.
has abstract
Das Problem der exakten Überde ...... exakte Überdeckung existiert.
@de
In de wiskunde is exacte overd ...... erdekking van een verzameling.
@nl
In mathematics, given a collec ...... neralized exact cover problem.
@en
Le problème de la couverture e ...... problèmes NP-complets de Karp.
@fr
Na matemática, dada uma coleçã ...... ata ligeiramente generalizado.
@pt
在一个全集X中若干子集的集合为S，精确覆盖是指，S的子集S* ...... 是一个NP-完全问题，也是卡普的二十一个NP-完全问题之一。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
691,360,454
comment
Das Problem der exakten Überde ...... m Beispiel sei und . Die Menge
@de
In de wiskunde is exacte overd ...... erdekking van een verzameling.
@nl
In mathematics, given a collec ...... nstraint satisfaction problem.
@en
Le problème de la couverture e ...... problèmes NP-complets de Karp.
@fr
Na matemática, dada uma coleçã ...... bém "no máximo uma" restrição.
@pt
在一个全集X中若干子集的集合为S，精确覆盖是指，S的子集S* ...... 是一个NP-完全问题，也是卡普的二十一个NP-完全问题之一。
@zh
label
Cobertura exata
@pt
Exact cover
@en
Exacte overdekking
@nl
Problem der exakten Überdeckung
@de
Problème de la couverture exacte
@fr
精确覆盖问题
@zh