536 search results - page 43 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
IANDC
2006
13 years 8 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
ORL
2008
13 years 8 months ago
2008
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
SIAMJO
2008
13 years 8 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...