Proof complexity of fragments of long-distance Q-resolution

DOI10.1007/978-3-030-24258-9_23zbMath1441.03044OpenAlexW2954718189MaRDI QIDQ2181942

Stefan Szeider, Tomáš Peitl, Friedrich Slivovsky

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24258-9_23

Mathematics Subject Classification ID

Complexity of proofs (03F20) Computational aspects of satisfiability (68R07)

Related Items (1)

Building strategies into QBF proofs

Uses Software

• CAQE

This page was built for publication: Proof complexity of fragments of long-distance Q-resolution