Exact Cover
Exact Cover is a constraint satisfaction problem in which the goal is to select a subset of subsets from a given collection such that each element in the universal set is included in exactly one selected subset.
37
Publications
2.3K
Citations
81
Authors
45
Institutions
Publications per year
2017–2026
9
Parents
37
Witness encryption and its applications
Sanjam Garg, Craig Gentry, Amit Sahai et al. · 2013 · 331 citations
1–5 of 37
81
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 81
45
New Jersey Institute of Technology
Newark, United States
3 h-index
8 publications
692 citations

Ames Research Center
Mountain View, United States
2 h-index
4 publications
612 citations
Universität Hamburg
Hamburg, Germany
2 h-index
2 publications
219 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
173 citations

National University of Defense Technology
Changsha, China
2 h-index
9 publications
672 citations
Simon Fraser University
Burnaby, Canada
2 h-index
4 publications
401 citations
University of California, Santa Cruz
Santa Cruz, United States
2 h-index
4 publications
656 citations

Lund University
Lund, Sweden
2 h-index
2 publications
33 citations
1–8 of 45
PRL · 3 publications · 355 citations
3
h-index
PRA · 2 publications · 134 citations
2
h-index
TOG · 2 publications · 173 citations
2
h-index
Repository · 2 publications · 51 citations
2
h-index
1 publications · 16 citations
1
h-index
1–5