31 search results - page 3 / 7 » Analyzing Walksat on random formulas |
RSA
2010
13 years 4 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
COMBINATORICS
2004
13 years 5 months ago
2004
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
ICS
2010
Tsinghua U.
13 years 10 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
SAT
2004
Springer
13 years 11 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
EJC
2006
13 years 5 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...