论文信息 - Topological Complexity of the Range Searching

Topological Complexity of the Range Searching

Abstract We prove an existence of a topological decision tree which solves the range searching problem for a system of real polynomials, in other words, the tree finds all feasible signs vectors of these polynomials, with the (topological) complexity logarithmic in the number of signs vectors. This answers the problem posed by H. Fournier and P. Koiran (1998, in “Proc. ACM STOC,” pp. 507–513).

Dima Grigoriev

[1] D. Grigor'ev. Complexity of deciding Tarski algebra , 1988 .

[2] Friedhelm Meyer auf der Heide. Fast algorithms for N-dimensional restrictions of hard problems , 1988, JACM.

[3] Pascal Koiran,et al. Are Lower Bounds Easier over theReals ? , 1998 .

[4] Stephen Smale,et al. On the topology of algorithms, I , 1987, J. Complex..

[5] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[6] Dima Grigoriev,et al. Complexity of Deciding Tarski Algebra , 1988, J. Symb. Comput..

[7] S. Meiser,et al. Point Location in Arrangements of Hyperplanes , 1993, Inf. Comput..