117
click to vote
ALT
15 years 4 months ago
1995 Springer 
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
|
Machine Learning