Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
Tobias Riege, Jörg Rothe · Zenodo (CERN European Organization for Nuclear Research) · 2006
NP-complete problems cannot have efficient algorithms unless P = NP. Due to their impor-tance in practice, however, it is useful to improve the known exponential-time algorithms for NP-complete problems. We survey some of the recent results on such improved exponential-time algorithms for the NP-complete problems satisfiability, graph colorability, and the domatic num-ber problem. The deterministic time bounds are compared with the corresponding time bounds of randomized algorithms, which often run faster but only at the cost of having a certain error probability.