8 search results - page 1 / 2 » The Complexity of Computing the Hilbert Polynomial of Smooth... |
JC
2007
13 years 11 months ago
2007
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 ...
JC
2006
13 years 11 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
JC
2011
13 years 6 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...