Sciweavers

13603 search results - page 12 / 2721
» On the Complexity of Computing Treelength
Sort
View
JC
2007
130views more  JC 2007»
13 years 9 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