Exact Cover Problem
The Exact Cover Problem is a combinatorial decision problem in which the goal is to select a subset of subsets from a given collection such that each element of the universal set is covered exactly once, distinguishing it from other set cover variants by requiring precise, non-overlapping coverage.
44
Publications
2.5K
Citations
113
Authors
56
Institutions
Publications per year
2017–2026
12
Parents
44
Witness encryption and its applications
Sanjam Garg, Craig Gentry, Amit Sahai et al. · 2013 · 331 citations
Approximate pyramidal shape decomposition
Ruizhen Hu, Honghua Li, Hao Zhang et al. · ACM Transactions on Graphics · 2014 · 114 citations
1–5 of 44
113
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 113
56
Nanjing University
Nanjing, China
3 h-index
3 publications
55 citations
Chalmers University of Technology
Gothenburg, Sweden
3 h-index
20 publications
1.6K citations
Simon Fraser University
Burnaby, Canada
3 h-index
6 publications
453 citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
4 publications
141 citations
Universität Hamburg
Hamburg, Germany
2 h-index
2 publications
219 citations
Canadian Institute for Advanced Research
Toronto, Canada
2 h-index
2 publications
145 citations

Ames Research Center
Mountain View, United States
2 h-index
4 publications
612 citations
Princeton University
Princeton, United States
2 h-index
2 publications
219 citations
1–8 of 56
PRL · 3 publications · 355 citations
3
h-index
2 publications · 161 citations
2
h-index
Repository · 2 publications · 51 citations
2
h-index
TOG · 2 publications · 173 citations
2
h-index
PRA · 2 publications · 134 citations
2
h-index
1–5