The following pages link to On the complexity of teaching (Q1892202):
Displayed 18 items.
- Teaching randomized learners with feedback (Q553294) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- A model of interactive teaching (Q1362340) (← links)
- Approximate testing and its relationship to learning (Q1389650) (← links)
- Queries revisited. (Q1426146) (← links)
- Exact learning via teaching assistants (Q1575459) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- Uniform characterizations of polynomial-query learnabilities (Q1870533) (← links)
- Online learning of binary and \(n\)-ary relations over clustered domains. (Q1872704) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- The subsumption lattice and query learning (Q2581757) (← links)
- A general dimension for query learning (Q2641869) (← links)
- PAC Learning under Helpful Distributions (Q2771492) (← links)
- Recent Developments in Algorithmic Teaching (Q3618563) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)