Szeider, S. (2004). Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Journal of computer and system sciences, 69(4), 656-674. https://doi.org/10.1016/j.jcss.2004.04.009
Chicago Style (17th ed.) CitationSzeider, Stefan. "Minimal Unsatisfiable Formulas with Bounded Clause-variable Difference Are Fixed-parameter Tractable." Journal of Computer and System Sciences 69, no. 4 (2004): 656-674. https://doi.org/10.1016/j.jcss.2004.04.009.
MLA (9th ed.) CitationSzeider, Stefan. "Minimal Unsatisfiable Formulas with Bounded Clause-variable Difference Are Fixed-parameter Tractable." Journal of Computer and System Sciences, vol. 69, no. 4, 2004, pp. 656-674, https://doi.org/10.1016/j.jcss.2004.04.009.
Warning: These citations may not always be 100% accurate.