受强制性开放获取政策约束的文章 - Nicolai Vorobjov了解详情
可在其他位置公开访问的文章：7 篇
Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems
M Korovina, N Vorobjov
Conference on Computability in Europe, 267-276, 2006
强制性开放获取政策： German Research Foundation
On topological lower bounds for algebraic computation trees
A Gabrielov, N Vorobjov
Foundations of Computational Mathematics 17, 61-72, 2017
强制性开放获取政策： US National Science Foundation
Effective cylindrical cell decompositions for restricted sub-Pfaffian sets
G Binyamini, N Vorobjov
International mathematics research notices 2022 (5), 3493-3510, 2022
强制性开放获取政策： European Commission, Federal Ministry of Education and Research, Germany
Upper and lower bounds on sizes of finite bisimulations of Pfaffian dynamical systems
M Korovina, N Vorobjov
Dagstuhl Seminar Proceedings, 2006
强制性开放获取政策： German Research Foundation
Bounds on sizes of finite bisimulations of Pfaffian dynamical systems
M Korovina, N Vorobjov
Theory of Computing Systems 43, 498-515, 2008
强制性开放获取政策： German Research Foundation
Reachability in one-dimensional controlled polynomial dynamical systems
M Korovina, N Vorobjov
International Andrei Ershov Memorial Conference on Perspectives of System …, 2011
强制性开放获取政策： German Research Foundation
Satisfiability of viability constraints for Pfaffian dynamics
M Korovina, N Vorobjov
International Andrei Ershov Memorial Conference on Perspectives of System …, 2006
强制性开放获取政策： German Research Foundation
出版信息和资助信息由计算机程序自动确定