Lower Bound Methods and Separation Results for On-Line Learning Models Wolfgang MaassGyörgy Turán OriginalPaper Pages: 107 - 145
Lower bound methods and separation results for on-line learning models Wolfgang MaassGyörgy Turán OriginalPaper Pages: 107 - 145
Learning Conjunctions of Horn Clauses Dana AngluinMichael FrazierLeonard Pitt OriginalPaper Pages: 147 - 164
Learning conjunctions of Horn clauses Dana AngluinMichael FrazierLeonard Pitt OriginalPaper Pages: 147 - 164
On the Computational Complexity of Approximating Distributions by Probabilistic Automata Naoki AbeManfred K. Warmuth OriginalPaper Pages: 205 - 260
On the computational complexity of approximating distributions by probabilistic automata Naoki AbeManfred K. Warmuth OriginalPaper Pages: 205 - 260
A Universal Method of Scientific Inquiry Daniel N. OshersonMichael StobScott Weinstein OriginalPaper Pages: 261 - 271
A universal method of scientific inquiry Daniel N. OshersonMichael StobScott Weinstein OriginalPaper Pages: 261 - 271