Computing combinatorial types of trajectories in Pfaffian Dynamics
暂无分享,去创建一个
[1] Savvas Pericleous,et al. New complexity bounds for cylindrical decompositions of sub-pfaffian sets , 2001, ISSAC '01.
[2] Thomas Brihaye,et al. On O-Minimal Hybrid Systems , 2004, HSCC.
[3] Nicolai Vorobjov,et al. Complexity of cylindrical decompositions of sub-Pfaffian sets , 2001 .
[4] Nicolai Vorobjov,et al. Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems , 2006, CiE.
[5] A. Wilkie. TAME TOPOLOGY AND O-MINIMAL STRUCTURES (London Mathematical Society Lecture Note Series 248) By L OU VAN DEN D RIES : 180 pp., £24.95 (US$39.95, LMS Members' price £18.70), ISBN 0 521 59838 9 (Cambridge University Press, 1998). , 2000 .
[6] Nicolai Vorobjov,et al. Pfaffian Hybrid Systems , 2004, CSL.
[7] Nicolai Vorobjov,et al. Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae , 2005, Discret. Comput. Geom..
[8] S. Basu,et al. Algorithms in real algebraic geometry , 2003 .
[9] Charles Steinhorn,et al. Tame Topology and O-Minimal Structures , 2008 .
[10] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[11] A. Gabrielov,et al. Complexity of computations with Pfaffian and Noetherian functions , 2004 .