Publication:4038688
From MaRDI portal
zbMath0765.68060MaRDI QIDQ4038688
Publication date: 18 May 1993
learning system; exact learning; structure of complexity classes; representation class; bounded learning; computational complexity of learning problems; computational power of polynomial time lemmas; polynomial time learnability; repetitive sets
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
Related Items
A framework for polynomial-time query learnability, Structural analysis of polynomial-time query learnability, Monotone term decision lists, The query complexity of learning DFA, Exact learning via teaching assistants