Research

Items by Vorobjov, Nicolai

Up a level
Export as [feed] RSS 1.0 [feed] Atom [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 20.

Book Sections

Korovina, M. and Vorobjov, N., 2012. Reachability in one-dimensional controlled polynomial dynamical systems. In: Clarke, E., Virbitskaite, I. and Voronkov, A., eds. Perspectives of systems informatics: 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised Selected Papers. Berlin: Springer, pp. 251-261. (Lecture Notes in Computer Science; 7162)

Korovina, M. and Vorobjov, N., 2006. Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems. In: Logical Approaches to Computational Barriers, Proceedings. Vol. 3988. , pp. 267-276. (Lecture Notes in Computer Science)

Vorobjov, N. and Gabrielov, A., 2004. Complexity of computations with Pfaffian and Noetherian functions. In: Ilyashenko, Y. and Rousseau, C., eds. Normal Forms, Bifurcations and Finiteness Problems in Differential Equations. Springer, p. 211. (NATO Science Series II)

Korovina, M. and Vorobjov, N., 2004. Pfaffian hybrid systems. In: Computer Science Logic, Proceedings. Vol. 3210. , pp. 430-441. (Lecture Notes in Computer Science)

Vorobjov, N., 2003. Effective model completeness of the theory of restricted Pfafflan functions. In: Computer Science Logic, Proceedings. Vol. 2803. , p. 544. (Lecture Notes in Computer Science)

Vorobjov, N., 2003. Effective quantifier elimination over real closed fields. In: Computer Science Logic, Proceedings. Vol. 2803. , p. 545. (Lecture Notes in Computer Science)

Vorobjov, N. and Pericleous, S., 2003. New Complexity bounds for cylindrical decompositions of sub_Pfaffian sets. In: Aronov, B., ed. Discrete and Computational Geometry. Springer.

Articles

Vorobjov, N. and Gabrielov, A., 2015. Forthcoming. On topological lower bounds for algebraic computation trees. Foundations of Computational Mathematics

Basu, S., Gabrielov, A. and Vorobjov, N., 2013. A Helly-type theorem for semi-monotone sets and monotone maps. Discrete & Computational Geometry, n/a, n/a.

Basu, S., Gabrielov, A. and Vorobjov, N., 2013. Monotone functions and maps. Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas, 107 (1), pp. 5-33.

Basu, S., Gabrielov, A. and Vorobjov, N., 2013. Semi-monotone sets. Journal of the European Mathematical Society, 15 (2), pp. 635-657.

Gabrielov, A. and Vorobjov, N., 2009. Approximation of definable sets by compact families, and upper bounds on homotopy and homology. Journal of the London Mathematical Society, 80 (1), pp. 35-54.

Korovina, M. and Vorobjov, N., 2008. Bounds on sizes of finite bisimulations of Pfaffian dynamical systems. Theory of Computing Systems, 43 (3-4), pp. 498-515.

Basu, S. and Vorobjov, N., 2007. On the number of homotopy types of fibres of a definable map. Journal of the London Mathematical Society, 76, pp. 757-776.

Gabrielov, A. and Vorobjov, N., 2005. Betti numbers of semialgebraic sets defined by quantifier-free formulae. Discrete & Computational Geometry, 33 (3), pp. 395-401.

Gabrielov, A., Vorobjov, N. and Zell, T., 2004. Betti numbers of semialgebraic and sub-Pfaffian sets. Journal of the London Mathematical Society, 69, pp. 27-43.

Grigoriev, D. and Vorobjov, N., 2002. Complexity of null- and Positivstellensatz proofs. Annals of Pure and Applied Logic, 113 (1-3), pp. 153-160.

Roy, M. F. and Vorobjov, N., 2002. The complexification and degree of a semi-algebraic set. Mathematische Zeitschrift, 239 (1), pp. 131-142.

Gabrielov, A. and Vorobjov, N., 2001. Complexity of cylindrical decompositions of sub-Pfaffian sets. Journal of Pure and Applied Algebra, 164 (1-2), pp. 179-197.

Conference or Workshop Items

Vorobjov, N. and Pericleous, S., 2001. New Complexity bounds for cylindrical decompositions of sub_Pfaffian sets. In: Proceedings of 2001 International Symposium on Symbolic and Algebriac Compuatation, 2001-01-01.

This list was generated on Mon Aug 31 11:01:23 2015 IST.