AI Chat AI Image Generator AI Video Text to Speech

A Note on Hardness of Computing Recursive Teaching Dimension

07/19/2023

∙

by Pasin Manurangsi, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 11/02/2022

Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique

We study the complexity of computing (and approximating) VC Dimension an...

0 Pasin Manurangsi, et al. ∙

research

∙ 04/13/2020

A Simple Randomized O(n log n)–Time Closest-Pair Algorithm in Doubling Metrics

Consider a metric space (P,dist) with N points whose doubling dimension ...

0 Anil Maheshwari, et al. ∙

research

∙ 05/17/2022

Minimum Tournaments with the Strong S_k-Property and Implications for Teaching

A tournament is said to have the S_k-property if, for any set of k playe...

0 Hans Ulrich Simon, et al. ∙

research

∙ 05/05/2022

Tournaments, Johnson Graphs, and NC-Teaching

Quite recently a teaching model, called "No-Clash Teaching" or simply "N...

0 Hans U. Simon, et al. ∙

research

∙ 02/18/2017

Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes

In this work we study the quantitative relation between the recursive te...

0 Lunjia Hu, et al. ∙

research

∙ 04/15/2019

Computing a Minimum-Width Cubic and Hypercubic Shell

In this paper, we study the problem of computing a minimum-width axis-al...

0 Sang Won Bae, et al. ∙

research

∙ 09/20/2022

VEST is W[2]-hard

In this short note, we show that the problem of VEST is W[2]-hard for pa...

0 Michael Skotnica, et al. ∙