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

Authors

81

  1. VS
    Vadim Smelyanskiy

    Ames Research Center, United States

    2 publications · 306 citations

    2

    h-index

  2. RH
    Ruizhen Hu

    Shenzhen University, China

    2 publications · 144 citations

    2

    h-index

  3. RO
    Román Orús

    Ikerbasque, Spain

    2 publications · 134 citations

    2

    h-index

  4. VC
    Vicky Choi

    Virginia Tech, United States

    2 publications · 54 citations

    2

    h-index

  5. IH
    Iris Hui-Ru Jiang

    National Yang Ming Chiao Tung University, Taiwan

    2 publications · 36 citations

    2

    h-index

1–5 of 81

Venues

  1. Physical Review Letters

    PRL · 3 publications · 355 citations

    3

    h-index

  2. Physical Review A

    PRA · 2 publications · 134 citations

    2

    h-index

  3. ACM Transactions on Graphics

    TOG · 2 publications · 173 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 51 citations

    2

    h-index

  5. 1

    h-index

1–5