3495 search results - page 29 / 699 » On the random satisfiable process |
RSA
2010
13 years 9 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
COMBINATORICS
2004
13 years 10 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...