The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Ganian, Robert; Khazaliya, Liana; McInerney, Fionn; Rocton, Mathis

by Robert Ganian, Liana Khazaliya, Fionn McInerney, Mathis Rocton

Reference:

The Computational Complexity of Positive Non-Clashing Teaching in GraphsRobert Ganian, Liana Khazaliya, Fionn McInerney, Mathis RoctonProceedings of the 13th International Conference on Learning Representations, ICLR 2025, 2025, OpenReview.net.Note: to appear

Bibtex Entry:

@inproceedings{GanianKMR25,
  author       = {Robert Ganian and Liana Khazaliya and Fionn McInerney and Mathis Rocton},
  title        = {The Computational Complexity of Positive Non-Clashing Teaching in Graphs},
  booktitle    = {Proceedings of the 13th International Conference on Learning Representations, {ICLR} 2025},
  publisher    = {OpenReview.net},
  year         = {2025},
  keywords = {ParAI},  
  note = {to appear}
}