The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913728554860544 |
|---|---|
| author | Ganian, Robert Khazaliya, Liana Inerney, Fionn Mc Rocton, Mathis |
| author_facet | Ganian, Robert Khazaliya, Liana Inerney, Fionn Mc Rocton, Mathis |
| contents | We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach an intelligent learner under the considered, previously established model. For any class of concepts, it is known that this problem can be effortlessly transferred to the setting of balls in a graph G. We establish (1) the NP-hardness of the problem even when restricted to instances with positive non-clashing teaching dimension k=2 and where all balls in the graph are present, (2) near-tight running time upper and lower bounds for the problem on general graphs, (3) fixed-parameter tractability when parameterized by the vertex integrity of G, and (4) a lower bound excluding fixed-parameter tractability when parameterized by the feedback vertex number and pathwidth of G, even when combined with k. Our results provide a nearly complete understanding of the complexity landscape of computing the positive non-clashing teaching dimension and answer open questions from the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_07665 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Computational Complexity of Positive Non-Clashing Teaching in Graphs Ganian, Robert Khazaliya, Liana Inerney, Fionn Mc Rocton, Mathis Computational Complexity Discrete Mathematics Data Structures and Algorithms Machine Learning We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach an intelligent learner under the considered, previously established model. For any class of concepts, it is known that this problem can be effortlessly transferred to the setting of balls in a graph G. We establish (1) the NP-hardness of the problem even when restricted to instances with positive non-clashing teaching dimension k=2 and where all balls in the graph are present, (2) near-tight running time upper and lower bounds for the problem on general graphs, (3) fixed-parameter tractability when parameterized by the vertex integrity of G, and (4) a lower bound excluding fixed-parameter tractability when parameterized by the feedback vertex number and pathwidth of G, even when combined with k. Our results provide a nearly complete understanding of the complexity landscape of computing the positive non-clashing teaching dimension and answer open questions from the literature. |
| title | The Computational Complexity of Positive Non-Clashing Teaching in Graphs |
| topic | Computational Complexity Discrete Mathematics Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2503.07665 |