2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2011★ 2 cited
Derandomizing HSSW Algorithm for 3-SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schöning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an O(1.3303^n)-time deter…
cs.CC2006
An Improved Exact Algorithm for the Domatic Number Problem
Tobias Riege, Jörg Rothe, Holger Spakowski +1
The 3-domatic number problem asks whether a given graph can be partitioned intothree dominating sets. We prove that this problem can be solved by a deterministic algorithm in time…