QRAT polynomially simulates \(\forall\)-Exp+Res

DOI10.1007/978-3-030-24258-9_13zbMath1441.68094OpenAlexW2953605684MaRDI QIDQ2181931

Martina Seidl, Benjamin Kiesl

Publication date: 20 May 2020

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure of proofs (03F07) Complexity of proofs (03F20) Computational aspects of satisfiability (68R07)

Related Items (3)

Never trust your solver: certification for SAT and QBF ⋮ How QBF expansion makes strategy extraction hard ⋮ Hardness and optimality in QBF proof systems modulo NP

This page was built for publication: QRAT polynomially simulates \(\forall\)-Exp+Res