|
|
Volumn , Issue , 1993, Pages 384-391
|
|
Lower bounds for PAC learning with queries
a
a
the Hungarian Acad
*
(Hungary)
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
BOOLEAN ALGEBRA;
COMPUTATIONAL COMPLEXITY;
EQUIVALENCE CLASSES;
FUNCTION EVALUATION;
LEARNING SYSTEMS;
MATHEMATICAL MODELS;
POLYNOMIALS;
RANDOM PROCESSES;
THEOREM PROVING;
BOOLEAN QUERIES;
LEARNING ALGORITHMS;
LOWER BOUNDS;
RESTRICTED SUBSET QUERIES;
ALGORITHMS;
|
|
EID: 0027806295
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/168304.168382 Document Type: Conference Paper |
|
Times cited : (9)
|
|
References (22)
|
