A Note on Hardness of Computing Recursive Teaching Dimension

07/19/2023

∙

by   Pasin Manurangsi, et al.

∙

0

∙

share

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^Ω(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.