Alekhnovich, Michael; Razborov, Alexander Satisfiability, branch-width and Tseitin tautologies. (English) Zbl 1243.68182 Comput. Complexity 20, No. 4, 649-678 (2011). MSC: 68Q17 68Q25 68T15 03F20 PDFBibTeX XMLCite \textit{M. Alekhnovich} and \textit{A. Razborov}, Comput. Complexity 20, No. 4, 649--678 (2011; Zbl 1243.68182) Full Text: DOI
Georgiou, Konstantinos; Papakonstantinou, Periklis A. Complexity and algorithms for well-structured \(k\)-SAT instances. (English) Zbl 1138.68538 Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 105-118 (2008). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{K. Georgiou} and \textit{P. A. Papakonstantinou}, Lect. Notes Comput. Sci. 4996, 105--118 (2008; Zbl 1138.68538) Full Text: DOI
Pan, Guoqiang; Vardi, Moshe Y. Symbolic techniques in satisfiability solving. (English) Zbl 1109.68104 J. Autom. Reasoning 35, No. 1-3, 25-50 (2005). MSC: 68T20 PDFBibTeX XMLCite \textit{G. Pan} and \textit{M. Y. Vardi}, J. Autom. Reasoning 35, No. 1--3, 25--50 (2005; Zbl 1109.68104) Full Text: DOI