Achieving new upper bounds for the hypergraph duality problem through logic
The hypergraph duality problem DUAL is defined as follows: given two simple hypergraphs $\mathcal{G}$ and $\mathcal{H}$, decide whether $\mathcal{H}$ consists precisely of all minimal transversals of $\mathcal{G}$ (in which case we say that $\mathcal{G}$ is the dual of $\mathcal{H}$). This problem i...
| Main Authors: | , |
|---|---|
| 格式: | Conference item |
| 出版: |
ACM
2014
|