Sciweavers

7 search results - page 1 / 2
» Computing the first Betti number and the connected component...
Sort
View
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 4 months ago
Computing the first Betti number and the connected components of semi-algebraic sets
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...
Saugata Basu, Richard Pollack, Marie-Franço...
DCG
2008
69views more  DCG 2008»
13 years 4 months ago
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
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...
Saugata Basu, Thierry Zell
JC
2007
130views more  JC 2007»
13 years 4 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
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 ...
Peter Scheiblechner
ITICSE
2003
ACM
13 years 10 months ago
Structuring CSed research studies: connecting the pieces
Changing conditions for teaching increase our motivation to understand the teaching and learning process. First time investigators of educational settings often feel uncertain abo...
Arnold Neville Pears, Mats Daniels
TCS
2008
13 years 4 months ago
Competitive graph searches
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...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul