Learning binary matroid ports

Authors:
Lisa Hellerstein;Collette Coullard
Affiliations:
Department of EECS, Northwestern University, Evanston, IL;Department of IEMS, Northwestern University, Evanston, IL
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

On the learnability of Boolean formulae

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An almost linear-time algorithm for graph realization

Mathematics of Operations Research
Computational limitations on learning from examples

Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning switch configurations

COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning read-once formulas with queries

Journal of the ACM (JACM)

Hi-index	0.00