Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms
Автор: 0
Аннотация:
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schöning, Schuler, and Watanabe (in STACS 2002, pp. 192–202, 2002). Thereby, we obtain an O(1.3303 n )-time deterministic algorithm for 3-SAT, which is currently fastest.