General lower bounds on the query complexity within the exact learning model
From MaRDI portal
Publication:1841883
DOI10.1016/S0166-218X(99)00223-1zbMath0967.68088OpenAlexW2030064505MaRDI QIDQ1841883
Norbert Klasner, Hans Ulrich Simon
Publication date: 20 March 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00223-1
Computational learning theory (68Q32) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
- Unnamed Item
- Lower bound methods and separation results for on-line learning models
- Learning from examples with unspecified attribute values.
- General lower bounds on the query complexity within the exact learning model
- Queries and concept learning
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Simulating access to hidden information while learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: General lower bounds on the query complexity within the exact learning model
