1547 search results - page 83 / 310 » Randomized Variable Elimination |
122
click to vote
SSIAI
2000
IEEE
15 years 7 months ago
2000
IEEE
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
114
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
129
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
105
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
116
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...