The Exponential Time Hypothesis [1]} implies that there is no
\(O^*(2^{o(k)})\) -time algorithm solving the MaxSAT problem. Based on this
hypothesis, there is a fixed constant \(c_0 > 1\)  such that the MaxSAT problem
cannot be solved in time \(O^*(c_0^k)\) . Therefore, there is a limit on the base
constant \(c > 1\)  for developing improved algorithms of time \(O^*(c^k)\)  for the
MaxSAT problem. Naturally, it will become more and more difficult to
further reduce the value of the constant \(c\) , which perhaps requires more careful
and tedious analysis on more and more complicated instance structures. We would
like to remark that compared to previous algorithms, our algorithm does not
require much more detailed analysis on instance structures. On the other hand,
our algorithm reaches the most significant improvement, which improves the base
\(c\)  by \(0.033\)  over the previous best result [2]}, while most previous
recent works [2]}, [4]} have the improvement bounded by
\(0.012\) .
