9 search results - page 1 / 2 » The decimation process in random k-SAT |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
SODA
1998
ACM
14 years 5 days ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
GRAPHICSINTERFACE
2003
14 years 6 days ago
2003
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...