Automating resolution is NP-hard

DOI10.1109/FOCS.2019.00038MaRDI QIDQ6944199zbMATH OpenFDO

Authors Albert Atserias, Moritz Müller

Publication date 12 August 2025

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

This page was built for publication: Automating resolution is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944199)