536 search results - page 8 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
JC
2007
13 years 7 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 ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
ECCC
2002
13 years 7 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...