Author:
Gabrielov Andrei,Vorobjov Nicolai
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference7 articles.
1. M. Ben-Or, Lower bounds for algebraic computation trees, in Proceedings of 15th Annual ACM Symposium on Theory of Computing 1983, 80–86.
2. P. Bürgisser, F. Cucker, Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré, in Complexity of Computations and Proofs (Jan Krajicek ed.), Quaderini di Matematica 13 (2005), 73-152.
3. D. Dobkin and R.J. Lipton, On the complexity of computations under varying sets of primitives, J. Comput. Syst. Sci. 18 (1979), 86-91.
4. A. Gabrielov, N. Vorobjov, Betti numbers of semialgebraic sets defined by quantifier-free formulae, Discrete Comput. Geom. 33 (2005), 395-401.
5. A. Gabrielov, N. Vorobjov, Approximation of definable sets by compact families, and upper bounds on homotopy and homology, J. London Math. Soc. 80 (2009), 35-54.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献