In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Changing conditions for teaching increase our motivation to understand the teaching and learning process. First time investigators of educational settings often feel uncertain abo...
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...