Exact learning via teaching assistants
type: Item
instance of: scholarly article
title: Exact learning via teaching assistants
zbMATH Open document ID: 0944.68155
DOI: 10.1016/S0304-3975(99)00266-2
author: Vikraman Arvind
author: N. V. Vinodchandran
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1493316
zbMATH Keywords: exact learning
zbMATH Keywords: teaching assistant model
MaRDI profile type: Publication
cites work: Queries and concept learning
cites work: Q4039803
cites work: Oracles and queries that are sufficient for exact learning
cites work: Quantitative Relativizations of Complexity Classes
cites work: Gap-definable counting classes
cites work: On the complexity of teaching
cites work: Q3253828
cites work: How many queries are needed to learn?
cites work: Q5614003
cites work: Q4038688
cites work: Structural analysis of polynomial-time query learnability
full work available at URL: s0304-3975(99)00266-2
OpenAlex ID: W1977976754
Recommended article: Teachability in computational learning
Recommended article: Learning Theory
Recommended article: Q3148815
Recommended article: Heuristic search of optimal machine teaching curricula
Recommended article: Exact learning of formulas in parallel
Recommended article: Exact Learning Composed Classes with a Small Number of Mistakes
Recommended article: Q3046222
description: scientific article; zbMATH DE number 1493316