Pages that link to "Item:Q4371689"
From MaRDI portal
The following pages link to How many queries are needed to learn? (Q4371689):
Displayed 22 items.
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- On the cut-off point for combinatorial group testing (Q1283788) (← links)
- Conjunctions of unate DNF formulas: Learning and structure (Q1383160) (← 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)
- The consistency dimension and distribution-dependent learning from queries. (Q1853513) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Learning closed Horn expressions (Q1854564) (← links)
- Uniform characterizations of polynomial-query learnabilities (Q1870533) (← links)
- Complexity parameters for first order classes (Q2433181) (← links)
- Projective DNF formulae and their revision (Q2473048) (← links)
- Improved bounds on quantum learning algorithms (Q2491374) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- The subsumption lattice and query learning (Q2581757) (← links)
- A general dimension for query learning (Q2641869) (← links)
- Canonical Horn Representations and Query Learning (Q3648750) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- Monotone term decision lists (Q5941293) (← links)