Bounding the radii of balls meeting every connected component of semi-algebraic sets

被引:12
作者
Basu, Saugata [1 ]
Roy, Marie-Francoise [2 ]
机构
[1] Purdue Univ, Dept Math, W Lafayette, IN 47907 USA
[2] Univ Rennes 1, IRMAR, URA 305, CNRS, F-35042 Rennes, France
基金
美国国家科学基金会;
关键词
Semi-algebraic sets; Bit-sizes;
D O I
10.1016/j.jsc.2010.06.009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove an explicit bound on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set S subset of R(k) defined by a weak sign condition involving s polynomials in Z[X(1) , ... , X(k)] having degrees at most d, and whose coefficients have bitsizes at most tau. Our bound is an explicit function of s, d, k and tau, and does not contain any undetermined constants. We also prove a similar bound on the radius of a ball guaranteed to intersect every connected component of S (including the unbounded components). While asymptotic bounds of the form 2(tau d0(k)) on these quantities were known before, some applications require bounds which are explicit and which hold for all values of s, d, k and tau. The bounds proved in this paper are of this nature. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1270 / 1279
页数:10
相关论文
共 7 条
[1]  
Basu S., 2009, ALGORITHMS COMPUTATI, V10
[2]  
BINYAMINI G, 2008, ARXIV08082952
[3]  
BINYAMINI G, 2008, ARXIV08082950
[4]   SOLVING SYSTEMS OF POLYNOMIAL INEQUALITIES IN SUBEXPONENTIAL TIME [J].
GRIGOREV, DY ;
VOROBJOV, NN .
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 5 (1-2) :37-64
[5]   Winning concurrent reachability games requires doubly-exponential patience [J].
Hansen, Kristoffer Arnsfelt ;
Koucky, Michal ;
Miltersen, Peter Bro .
24TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2009, :332-+
[6]   On the minimum of a positive polynomial over the standard simplex [J].
Jeronimo, Gabriela ;
Perrucci, Daniel .
JOURNAL OF SYMBOLIC COMPUTATION, 2010, 45 (04) :434-442
[7]   ON THE COMPUTATIONAL-COMPLEXITY AND GEOMETRY OF THE 1ST-ORDER THEORY OF THE REALS .1. INTRODUCTION - PRELIMINARIES - THE GEOMETRY OF SEMI-ALGEBRAIC SETS - THE DECISION PROBLEM FOR THE EXISTENTIAL THEORY OF THE REALS [J].
RENEGAR, J .
JOURNAL OF SYMBOLIC COMPUTATION, 1992, 13 (03) :255-299