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. © 1997 Kluwer Academic Publishers.
Author supplied keywords
Cite
CITATION STYLE
APA
Bshouty, N. H. (1997). Exact learning of formulas in parallel. Machine Learning, 26(1), 25–41. https://doi.org/10.1023/A:1007320031970
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free