Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Should Algorithms for Random SAT and Max-SAT be Different?   We analyze to what extent the random SAT and Max-SAT problems differ in their
properties. Our findings suggest that for random $k$-CNF with ratio in a
certain range, Max-SAT can be solved by any SAT algorithm with subexponential
slowdown, while for formulae with ratios greater than some constant, algorithms
under the random walk framework require substantially different heuristics. In
light of these results, we propose a novel probabilistic approach for random
Max-SAT called ProMS. Experimental results illustrate that ProMS outperforms
many state-of-the-art local search solvers on random Max-SAT benchmarks.

18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph