Sidorov, K., van der Linden, K., Correia, G. H. d. A., de Weerdt, M., & Demirović, E. (2024). How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization.
Cita Chicago Style (17a ed.)Sidorov, Konstantin, Koos van der Linden, Gonçalo Homem de Almeida Correia, Mathijs de Weerdt, y Emir Demirović. How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization. 2024.
Cita MLA (9a ed.)Sidorov, Konstantin, et al. How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization. 2024.
Precaución: Estas citas no son 100% exactas.