Coste-Marquis, Sylvie; Le Berre, Daniel; Letombe, Florian; Marquis, Pierre Complexity results for quantified Boolean formulae based on complete propositional languages. (English) Zbl 1116.68082 J. Satisf. Boolean Model. Comput. 1, No. 1, 61-88 (2006). MSC: 68T20 68T30 PDF BibTeX XML Cite \textit{S. Coste-Marquis} et al., J. Satisf. Boolean Model. Comput. 1, No. 1, 61--88 (2006; Zbl 1116.68082)
Dantsin, Evgeny; Wolpert, Alexander A faster clause-shortening algorithm for SAT with no restriction on clause length. (English) Zbl 1116.68115 J. Satisf. Boolean Model. Comput. 1, No. 1, 49-60 (2006). MSC: 68W20 68T20 PDF BibTeX XML Cite \textit{E. Dantsin} and \textit{A. Wolpert}, J. Satisf. Boolean Model. Comput. 1, No. 1, 49--60 (2006; Zbl 1116.68115)
Anjos, Miguel F. Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems. (English) Zbl 1194.90064 J. Satisf. Boolean Model. Comput. 1, No. 1, 1-47 (2006). MSC: 90C22 PDF BibTeX XML Cite \textit{M. F. Anjos}, J. Satisf. Boolean Model. Comput. 1, No. 1, 1--47 (2006; Zbl 1194.90064)