Learning conjunctions of two unate DNF formulas (extended abstract): computational and informational results

Authors:
Aaron Feigelson;Lisa Hellerstein
Affiliations:
Department of EECS, Northwestern University, Evanston, IL;Department of EECS, Northwestern University, Evanston, IL
Venue:
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Year:
1996

Computational learning theory: survey and selected bibliography

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning read-once formulas with queries

Journal of the ACM (JACM)
On the limits of proper learnability of subclasses of DNF formulas

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
How many queries are needed to learn?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Complexity theoretic hardness results for query learning

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

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

Machine Learning
Queries and Concept Learning

Machine Learning

Hi-index	0.00