Exact Learning of Formulas in Parallel
Abstract
We investigate the parallel complexity of learning formulas from membership and equivalence queries. We show that many restricted classes of boolean functions cannot be efficiently learned in parallel with a polynomial number of processors.
Cite
Text
Bshouty. "Exact Learning of Formulas in Parallel." Machine Learning, 1997. doi:10.1023/A:1007320031970Markdown
[Bshouty. "Exact Learning of Formulas in Parallel." Machine Learning, 1997.](https://mlanthology.org/mlj/1997/bshouty1997mlj-exact/) doi:10.1023/A:1007320031970BibTeX
@article{bshouty1997mlj-exact,
title = {{Exact Learning of Formulas in Parallel}},
author = {Bshouty, Nader H.},
journal = {Machine Learning},
year = {1997},
pages = {25-41},
doi = {10.1023/A:1007320031970},
volume = {26},
url = {https://mlanthology.org/mlj/1997/bshouty1997mlj-exact/}
}