In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...