Combinatorial results on the complexity of teaching and learning

DOI10.1007/3-540-58338-6_86zbMath1493.68168OpenAlexW1579477158MaRDI QIDQ5096898

Tibor Hegedűs

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_86

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (3)

Exact learning from an honest teacher that answers membership queries ⋮ Learning Boolean halfspaces with small weights from membership queries ⋮ Measuring teachability using variants of the teaching dimension

Cites Work

• Teachability in computational learning
• Teaching a smarter learner.
• Lower bound methods and separation results for on-line learning models
• Queries and concept learning
• Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial results on the complexity of teaching and learning