Complexity of cylindrical decompositions of sub-Pfaffian sets

[摘要] We construct an algorithm for a cylindrical cell decomposition of a closed cube I(n)subset ofR(n) compatible with a restricted sub-Pfaffian subset Y subset ofI(n), provided an oracle deciding consistency of a system of Pfaffian equations and inequalities is given. In particular, the algorithm produces the complement (Y) over tilde = I-n/Y. The complexity bound of the algorithm, the number and formats of cells are doubly exponential in n(3). (C) 2001 Elsevier Science B.V. All rights reserved.

[发布日期] 2001-10-24

[效力级别]  Proceedings Paper