Solution independence and self-referential instances
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913085333176320 |
|---|---|
| author | Zhou, Guangyan Wang, Bin Wang, Jianxin Xu, Ke |
| author_facet | Zhou, Guangyan Wang, Bin Wang, Jianxin Xu, Ke |
| contents | In this paper, we investigate the hitting set problem and demonstrate that solution independence is the crucial property underlying the construction of self-referential instances. As a special case of the hitting set problem, the vertex cover problem lacks the solution independence property. This distinction accounts for its ability to evade exhaustive search, as correlations among candidate solutions can be leveraged to compress the overall search space. In contrast, the dominating set problem on hypergraphs, which is also a special case of the hitting set problem, satisfies the solution independence property, thereby enabling the construction of self-referential instances. Moreover, we prove that these self-referential instances possess an irreducible property, implying that any algorithm for solving such instances must process nearly the entire graph to yield a correct solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_02174 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Solution independence and self-referential instances Zhou, Guangyan Wang, Bin Wang, Jianxin Xu, Ke Computational Complexity Data Structures and Algorithms In this paper, we investigate the hitting set problem and demonstrate that solution independence is the crucial property underlying the construction of self-referential instances. As a special case of the hitting set problem, the vertex cover problem lacks the solution independence property. This distinction accounts for its ability to evade exhaustive search, as correlations among candidate solutions can be leveraged to compress the overall search space. In contrast, the dominating set problem on hypergraphs, which is also a special case of the hitting set problem, satisfies the solution independence property, thereby enabling the construction of self-referential instances. Moreover, we prove that these self-referential instances possess an irreducible property, implying that any algorithm for solving such instances must process nearly the entire graph to yield a correct solution. |
| title | Solution independence and self-referential instances |
| topic | Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2605.02174 |