Author:
Gabrielov Andrei,Vorobjov Nicolai
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference9 articles.
1. P. Bürgisser & F. Cucker (2005). Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré. In Complexity of Computations and Proofs (Jan Krajicek ed.), volume 13 of Quaderini di Matematica, 73–152.
2. Gabrielov A., Vorobjov N. (2005) Betti numbers of semialgebraic sets defined by quantifier-free formulae. Discrete Comput. Geom. 33(3): 395–401
3. Gabrielov A., Vorobjov N. (2009) Approximation of definable sets by compact families, and upper bounds on homotopy and homology. J. London Math. Soc. 80(2): 493–496
4. A. Gabrielov & N. Vorobjov (2015). On topological lower bounds for algebraic computation trees. Found. Comput. Math., doi:
10.1007/s10208-015-9283-7
.
5. Gabrielov A., Vorobjov N., Zell T. (2004) Betti numbers of semialgebraic and sub-Pfaffian sets. J. London Math. Soc. 69(2): 27–43