A Note on Hardness of Computing Recursive Teaching Dimension

Pasin Manurangsi

A Note on Hardness of Computing Recursive Teaching Dimension

Computational Complexity 2023-07-20 v1 Machine Learning

Authors: Pasin Manurangsi

Abstract

In this short note, we show that the problem of computing the recursive teaching dimension (RTD) for a concept class (given explicitly as input) requires $n^{\Omega(\log n)}$ -time, assuming the exponential time hypothesis (ETH). This matches the running time $n^{O(\log n)}$ of the brute-force algorithm for the problem.

Cite

@article{arxiv.2307.09792,
  title  = {A Note on Hardness of Computing Recursive Teaching Dimension},
  author = {Pasin Manurangsi},
  journal= {arXiv preprint arXiv:2307.09792},
  year   = {2023}
}

Comments

To appear in IPL

Related papers

View all related →