|
|
Volumn , Issue , 1993, Pages 58-66
|
|
On the query complexity of learning
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
BOOLEAN ALGEBRA;
COMPUTATIONAL COMPLEXITY;
EQUIVALENCE CLASSES;
INFORMATION THEORY;
POLYNOMIALS;
QUERY LANGUAGES;
RANDOM PROCESSES;
SET THEORY;
THEOREM PROVING;
DISTRIBUTION FREE LEARNING;
QUERY COMPLEXITY;
LEARNING SYSTEMS;
|
|
EID: 0027837032
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/168304.168312 Document Type: Conference Paper |
|
Times cited : (5)
|
|
References (12)
|
