Leonard Pitt

Available identifiers

Publication	Date of Publication	Type
Version spaces and the consistency problem	2006-02-07	Paper
Sublinear time approximate clustering	2002-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4230377	2002-01-20	Paper
Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries	2000-11-22	Paper
Complexity theoretic hardness results for query learning	1998-10-26	Paper
On Learning Read-k-Satisfy-j DNF	1998-09-21	Paper
Classic learning	1997-03-16	Paper
Learning from a consistently ignorant teacher	1996-11-26	Paper
On the learnability of disjunctive normal form formulas	1995-10-29	Paper
The minimum consistent DFA problem cannot be approximated within any polynomial	1993-05-16	Paper
Learning conjunctions of Horn clauses	1993-04-01	Paper
A bounded approximation for the minimum cost 2-sat problem	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4013526	1992-09-27	Paper
On the necessity of Occam algorithms	1992-09-27	Paper
Prediction-preserving reducibility	1990-01-01	Paper
Computational limitations on learning from examples	1988-01-01	Paper
Probability and plurality for aggregations of learning machines	1988-01-01	Paper
A note on extending Knuth's tree estimator to directed acyclic graphs	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3771654	1987-01-01	Paper
Equivalent approximation algorithms for node cover	1986-01-01	Paper

This page was built for person: Leonard Pitt