DocumentCode
1566956
Title
On the exact learning of formulas in parallel
Author
Bshouty, Nader H. ; Cleve, Richard
Author_Institution
Dept. of Comput. Sci., Calgary Univ., Alta., Canada
fYear
1992
Firstpage
513
Lastpage
522
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
Keywords
computational complexity; learning (artificial intelligence); parallel algorithms; equivalence queries; exact learning; learning problems; membership; parallel; parallel complexity; polynomial time; Arithmetic; Computer science; Parallel algorithms; Parallel processing; Phase change random access memory; Polynomials; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location
Pittsburgh, PA
Print_ISBN
0-8186-2900-2
Type
conf
DOI
10.1109/SFCS.1992.267800
Filename
267800
Link To Document