Back to search

Computational limitations on learning from examples

Data up to Jan 2025

Published1988
Citations542
References28

Total Citations Per Year

Abstract

References (28)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

A theory of the learnable

1984 • 4,471 citations

A theory of the learnable

1984 • 2,968 citations

A Greedy Heuristic for the Set-Covering Problem

1979 • 2,542 citations

How to construct random functions

1986 • 2,086 citations

Occam's Razor

1987 • 1,044 citations

Inductive Inference: Theory and Methods

1983 • 911 citations

Complexity of automaton identification from given data

1978 • 767 citations

Inductive inference of formal languages from positive data

1980 • 756 citations

Computational Complexity of Probabilistic Turing Machines

1977 • 709 citations

Toward a mathematical theory of inductive inference

1975 • 680 citations

Finding patterns common to a set of strings

1980 • 605 citations

Inference of Reversible Languages

1982 • 540 citations

Comparison of identification criteria for machine inductive inference

1983 • 415 citations

The Complexity of Near-Optimal Graph Coloring

1976 • 314 citations

Machine learning: an artificial intelligence approach volume III

1990 • 257 citations

On the complexity of minimum inference of regular sets

1978 • 256 citations

A Comparative Review of Selected Methods for Learning from Examples

1983 • 238 citations

A study of grammatical inference

1969 • 222 citations

Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

1986 • 168 citations

A Characterization Of Probabilistic Inference

2005 • 62 citations

On the power of probabilistic strategies in inductive inference

1983 • 52 citations

Inductive inference of approximations

1986 • 36 citations

On the error correcting power of pluralism in BC-type inductive inference

1983 • 32 citations

Inferring the structure of a Markov Chain from its output

1985 • 26 citations

A new approximate graph coloring algorithm

1982 • 20 citations

Functions computable in the limit by probabilistic machines

1975 • 16 citations

Deleted Work

1955 • 0 citations

Cited By (0)

No citing papers found in database

Computational limitations on learning from examples (1988) – Journal of the ACM | Metascience Observatory Explorer