scientific article
From MaRDI portal
Publication:4038688
zbMath0765.68060MaRDI QIDQ4038688
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
learning systemexact learningstructure of complexity classesrepresentation classbounded learningcomputational complexity of learning problemscomputational power of polynomial time lemmaspolynomial time learnabilityrepetitive sets
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (7)
The query complexity of learning DFA ⋮ A framework for polynomial-time query learnability ⋮ Structural analysis of polynomial-time query learnability ⋮ On the complexity of small description and related topics ⋮ The complexity of learning minor closed graph classes ⋮ Monotone term decision lists ⋮ Exact learning via teaching assistants
This page was built for publication:
