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( n)-time, assuming the exponential time hypothesis (ETH). This matches the running time nO( n) of the brute-force algorithm for the problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.