Learning 2µ DNF Formulas and Kµ Decision Trees

Cite

Text

Hancock. "Learning 2µ DNF Formulas and Kµ Decision Trees." Annual Conference on Computational Learning Theory, 1991. doi:10.1016/B978-1-55860-213-7.50022-5

Markdown

[Hancock. "Learning 2µ DNF Formulas and Kµ Decision Trees." Annual Conference on Computational Learning Theory, 1991.](https://mlanthology.org/colt/1991/hancock1991colt-learning/) doi:10.1016/B978-1-55860-213-7.50022-5

BibTeX

@inproceedings{hancock1991colt-learning,
  title     = {{Learning 2µ DNF Formulas and Kµ Decision Trees}},
  author    = {Hancock, Thomas R.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1991},
  pages     = {199-209},
  doi       = {10.1016/B978-1-55860-213-7.50022-5},
  url       = {https://mlanthology.org/colt/1991/hancock1991colt-learning/}
}