Title: On the exact learning of formulas in parallel
Abstract: The authors investigate the parallel complexity of learning formulas from membership and equivalence queries. They consider a number of learning problems that can be solved sequentially in polynomial time. They prove some upper and lower bounds on the number of parallel steps required to solve these problems with a polynomial number of processors.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Publication Year: 1992
Publication Date: 1992-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 25
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot