Dynamic QBF Dependencies in Reduction and Expansion

DOI10.1145/3355995zbMath1433.03138OpenAlexW2983793616WikidataQ114071247 ScholiaQ114071247MaRDI QIDQ4972172

Joshua Blinkhorn, Olaf Beyersdorff

Publication date: 22 November 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3355995

zbMATH Keywords

proof complexityquantified Boolean formulasdependency schemes

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

QBFFam: a tool for generating QBF families from proof complexity

This page was built for publication: Dynamic QBF Dependencies in Reduction and Expansion