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

Authors

113

  1. VC
    Vicky Choi

    Virginia Tech, United States

    2 publications · 54 citations

    2

    h-index

  2. VS
    Vadim Smelyanskiy

    Ames Research Center, United States

    2 publications · 306 citations

    2

    h-index

  3. HC
    Hua-Yu Chang

    National Yang Ming Chiao Tung University, Taiwan

    2 publications · 36 citations

    2

    h-index

  4. MS
    Marika Svensson

    Chalmers University of Technology, Sweden

    2 publications · 195 citations

    2

    h-index

  5. DC
    Daniel Cohen‐Or

    Tel Aviv University, Israel

    2 publications · 173 citations

    2

    h-index

1–5 of 113

Venues

  1. Physical Review Letters

    PRL · 3 publications · 355 citations

    3

    h-index

  2. Physical Review Applied

    2 publications · 161 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 51 citations

    2

    h-index

  4. ACM Transactions on Graphics

    TOG · 2 publications · 173 citations

    2

    h-index

  5. Physical Review A

    PRA · 2 publications · 134 citations

    2

    h-index

1–5