A note on hardness of computing recursive teaching dimension

INFORMATION PROCESSING LETTERS（2024）

引用 0|浏览6

暂无评分

摘要

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 nS2(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.& COPY; 2023 Elsevier B.V. All rights reserved.

查看译文

关键词

Recursive teaching dimension,Computational complexity,Fine-grained complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要