Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. M. Ben-Or, Lower bounds for algebraic computation trees. Proc. 15th Ann. ACM Symp. Theory of Computing, Boston MA, 1983, 80–86.
2. M. Ben-Or, E. Feig, D. Kozen, and P. Tiwari, A fast parallel algorithm for determining all roots of a polynomial with real roots. To appear in Proc. 18th Ann. ACM Symp. Theory of Computing, Berkeley CA, 1986.
3. M. Ben-Or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry. Proc. 16th Ann. ACM Symp. Theory of Computing, Washington DC, 1984, 457–464.
4. D. Bini, Parallel solution of certain Toeplitz linear systems. SIAM J. Computing 13 (1984), 268–276.
5. D. Bini and V. Pan, Fast parallel algorithms for polynomial division over arbitrary field of constants. Nota interna, Dipartimento di Informatica, Università di Pisa, 1984.
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献