Author:
Koiran Pascal,Perifel Sylvain
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Blum, L., et al.: Complexity and Real Computation. Springer, Heidelberg (1998)
2. Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society 21(1), 1–46 (1989)
3. Algorithms and Computation in Mathematics;P. Bürgisser,2000
4. Chapuis, O., Koiran, P.: Saturation and stability in the theory of computation over the reals. Annals of Pure and Applied Logic 99, 1–49 (1999)
5. Charbit, P., et al.: Finding a vector orthogonal to roughly half a collection of vectors. Accepted for publication in Journal of Complexity (2006), Available from
http://perso.ens-lyon.fr/pascal.koiran/publications.html
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献