On the exact learning of formulas in parallel

Authors:
N. H. Bshouty;R. Cleve
Affiliations:
Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 2

Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Computational Aspects of Parallel Attribute-Efficient Learning

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

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.