Further investigations into regular XORSAT
Matti Järvisalo · 2006
Recent years have witnessed rapid progress both in the foundations of and in applying state-of-art solvers for the propositional satisfiability problem (SAT). The study of sources for hard SAT instances is motivated by the need for interesting