Author:
Beltrán Carlos,Shub Michael
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference15 articles.
1. B. Beauzamy, J.-L. Frot, C. Millour, Massively parallel computations on many-variable polynomials. Ann. Math. Artif. Intell. 16(1–4), 251–283 (1996). MR MR1389850 (98c:68078)
2. C. Beltrán, L.M. Pardo, On Smale‘s 17th problem: a probabilistic positive answer. Found. Comput. Math. Online First DOI: 10.1007/s10208-005-0211-0
3. C. Beltrán, L.M. Pardo, On the complexity of non-universal polynomial equation solving: old and new results, in Foundations of Computational Mathematics, ed. by L. Pardo, A. Pinkus, E. Süli, M. Todd, Santander, 2005 (Cambridge University Press, Cambridge, 2006), pp. 1–35
4. C. Beltrán, L.M. Pardo, Smale’s 17th problem: average polynomial time to compute affine and projective solutions. Preprint, 2007
5. C. Borges, L.M. Pardo. Personal communication
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献