Pages that link to "Item:Q4298370"
From MaRDI portal
The following pages link to A framework for polynomial-time query learnability (Q4298370):
Displaying 9 items.
- PACS, simple-PAC and query learning (Q294709) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- LAQP: learning-based approximate query processing (Q2055585) (← links)
- Structural analysis of polynomial-time query learnability (Q4298371) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- On the complexity of small description and related topics (Q5096821) (← links)
- The complexity of learning minor closed graph classes (Q6083915) (← links)