FAQ

Exact cover

Known as: Exact cover problem, Exact hitting set 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
0246819792017

Related topics

Related topics

20 relations
3-dimensional matchingAlgorithmBacktrackingComputer science
(More)

Broader (1)

Theoretical computer science

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Exact cover
Algorithm
Computer science
Recursion
Decision problem
Constraint satisfaction problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The phase transition in random regular exact cover
A k-uniform, d-regular instance of Exact Cover is a family of m sets Fn,d,k = {Sj ⊆ {1, . . . , n}}, where each subset has size k… (More)
Is this relevant?
2014
2014
Design approach for component-based automation systems using exact cover
Networked systems consisting of many different components are gaining more and more importance in human's living environment (e.g… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2010
2010
Python for education: the exact cover problem
Python implementation of Algorithm X by Knuth is presented. Algorithm X finds all solutions to the exact cover problem. The… (More)
  • figure 1
  • table 1
  • table 2
  • figure 3
  • table 3
Is this relevant?
2010
2010
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each… (More)
  • table 1
  • table 2
Is this relevant?
2008
2008
Exact Cover with Light
We suggest a new optical solution for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2008
2008
The Phase Transition in Exact Cover
We study EC3, a variant of Exact Cover which is equivalent to Positive 1-in-3 SAT. Random instances of EC3 were recently used as… (More)
Is this relevant?
2004
2004
Properties of R-Sausages
 
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2003
2003
Solving the set cover problem and the problem of exact 3 cover by 3 - sets in the Adleman – Lipton model
9 Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards… (More)
  • table 2
  • table 1
Is this relevant?
1999
1999
Faster Exact Solutions for Some NP-Hard Problems
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. The solutions are based… (More)
Is this relevant?
1998
1998
Automating the synthesis of decision procedures in a constructive metatheory
We present an approach to the automatic construction of decision procedures, via a detailed example in propositional logic. The… (More)
Is this relevant?