1. E. Ya. Dantsin, “Two tautologihood proof systems based on the split method,” Zap. Nauchn. Semin. LOMI, 105, 24–44 (1981).
2. A. Golovnev, A. S. Kulikov, A. V. Smal, and S. Tamaki, “Circuit size lower bounds and #SAT upper bounds through a general framework,” in: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs 58, Schloss Dagstuhl – Leibniz–Zentrum fuer Informatik, (2016), pp. 45:1–45:16.
3. E. A. Hirsch, “New worst-case upper bounds for SAT,” J. Automated Reasoning, 24, No. 4, 397–420 (2000).
4. O. Kullmann, “New methods for 3-SAT decision and worst-case analysis,” Theor. Computer Sci., 223, No. 1–2, 1–72 (1999).
5. O. Kullmann and H. Luckhardt, “Deciding propositional tautologies: Algorithms and their complexity,” Technical report, Fachbereich Mathematik, Johann Wolfgang Goethe Universität (1997).