Pages that link to "Item:Q1872731"
From MaRDI portal
The following pages link to On the complexity of approximating the VC dimension. (Q1872731):
Displaying 6 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
