A note on hardness of computing recursive teaching dimension

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Ω(log⁡n)-time, assuming the exponential time hypothesis (ETH). This matches the running time nO(log⁡n) of the brute-force algorithm for the problem.