On the exact learning of formulas in parallel

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 513-522

  Bshouty, Nader H ^a   Cleve, Richard ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EQUIVALENCE QUERIES; EXACT LEARNING; LEARNING PROBLEM; PARALLEL COMPLEXITY; POLYNOMIAL NUMBER; POLYNOMIAL-TIME; UPPER AND LOWER BOUNDS;

POLYNOMIAL APPROXIMATION;

EID: 84961323732     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267800     Document Type: Conference Paper

References (21)

1. D. Angluin, Queries and concept learning. Machine Learning, 2, pages 319-342, 1987.
2. D. Angluin, L. Hellerstein, and M. Karpin-ski. Learning read-once formulas with queries. Technical report, Report No. UCB/CSD 89/528, Computer Science Division, University of California Berkeley, 1989. To appear, J. ACM.
3. D. Angluin and M. Kharitonov. When won't membership queries help? In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 444-454, 1991.
4. M. Ben-Or and P. Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the 20th Annual Symposium on the Theory of Computing, pages 301-309, 1988.
5. R. P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201-206, 1974.
6. N. H. Bshouty, T. R. Hancock, and L. Hellerstein. Learning arithmetic read-once formulas. In Proceedings of the 24th Annual Symposium on the Theory of Computing, 1992.
7. N. H. Bshouty, T. R. Hancock, and L. Hellerstein. Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates. In The 1992 Workshop on Computational Learning Theory, 1992.
8. N. H. Bshouty, T. R. Hancock, L. Hellerstein, and M. Karpinski. Read-once threshold formulas, justifying assignments, and transformations. Unpublished Manuscript.
9. A. Borodin and P. Tiwari. On the decidability of sparse univariate polynomials. In Proceedings of the 22nd Symposium on the Theory of Computing, 1990.
10. S. A. Goldman, M. J. Kearns, and R. E. Schapire. Exact identification of circuits using fixed points of amplification functions. In Proceedings of the 31st Symposium on Foundations of Computer Science, 1990.
11. D.Y. Grigoriev, M. Karpinski, and M.F. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. Technical report, Research Report No. 8523-C5, University of Bonn (1988), 1988. To appear in SIAM J. Comp.
12. D.Y. Grigoriev, M. Karpinski, and M.F Singer. Interpolation of sparse rational functions without knowing bounds on the exponent. In Proceedings of the 31st Symposium on Foundations of Computer Science, 1990.
13. T. Hancock. Identifying μ-formula decision trees with queries. In The 1990 Workshop on Computational Learning Theory, pages 23-37, 1990.
14. T. Hancock and L. Hellerstein. Learning read-once formulas over fields and extended bases. In The 1991 Workshop on Computational Learning Theory, 1991.
15. J. Heintz and C. P. Schnorr. Testing polynomials that are easy to compute. In Proceedings of the 12th Annual Symposium on the Theory of Computing, pages 262-272, 1980.
16. R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. 4CM27(4):831-838, 1980.
17. W. Maass and G. Turan. On the complexity of learning from counterexamples and membership queries. In Proceedings of the 31st Symposium on Foundations of Computer Science, 1990.
18. M. R. Roth and G. M. Benedek. Interpolation and approximation of sparse multivariate polynomials over gf(2). Manuscript (to appear in SIAM J. Computing), 1989.
19. J. T. Schwartz. Fast polynomial algorithms for verification of polynomial identities. Journal of the Association for Computing Machinery, 27(4):701-707, 1980.
20. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984.
21. J. S. Vitter and J. Lin, Learning in paral- lel, The 1988 Workshop on Computational Learning Theory, pages 106-124, 1988.