当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A note on hardness of computing recursive teaching dimension
Information Processing Letters ( IF 0.5 ) Pub Date : 2023-07-22 , DOI: 10.1016/j.ipl.2023.106429 Pasin Manurangsi
中文翻译:
关于递归教学维数计算难度的一点思考
更新日期:2023-07-22
Information Processing Letters ( IF 0.5 ) Pub Date : 2023-07-22 , DOI: 10.1016/j.ipl.2023.106429 Pasin Manurangsi
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 -time, assuming the exponential time hypothesis (ETH). This matches the running time of the brute-force algorithm for the problem.
中文翻译:
关于递归教学维数计算难度的一点思考
在这篇简短的笔记中,我们展示了计算概念类的递归教学维度(RTD)的问题(明确作为输入给出)需要-时间,假设指数时间假设(ETH)。这与运行时间相匹配该问题的暴力算法。