The following pages link to Leonard Pitt (Q676239):
Displayed 20 items.
- Classic learning (Q676240) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- Probability and plurality for aggregations of learning machines (Q1104113) (← links)
- A note on extending Knuth's tree estimator to directed acyclic graphs (Q1108027) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- On the necessity of Occam algorithms (Q1193631) (← links)
- Learning conjunctions of Horn clauses (Q1207302) (← links)
- Complexity theoretic hardness results for query learning (Q1266164) (← links)
- On the learnability of disjunctive normal form formulas (Q1900981) (← links)
- Learning from a consistently ignorant teacher (Q1924383) (← links)
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries (Q1961324) (← links)
- (Q2768331) (← links)
- (Q3771654) (← links)
- Computational limitations on learning from examples (Q3813320) (← links)
- (Q4013526) (← links)
- The minimum consistent DFA problem cannot be approximated within any polynomial (Q4033836) (← links)
- On Learning Read-k-Satisfy-j DNF (Q4210120) (← links)
- (Q4230377) (← links)